首页
技术
登录
6mi
u
盘
搜
搜 索
技术
LeetCode1470
LeetCode1470
技术
2022-08-01
76
class Solution { public int[] shuffle(int[] nums, int n) { int[] ans = new int[nums.length]; int index = 0; for(int i = 0 ;i < n;i++){ ans[index++] = nums[i]; ans[index++] = nums[n+i]; } return ans; } }
转载请注明原文地址:https://ipadbbs.8miu.com/read-31414.html
最新回复
(
0
)