LeetCode
Code
class Solution {
public int[] shuffle(int[] nums, int n) {
int[] result = new int[nums.length];
int currentIdx = 0;
for (int i = 0; i < n; i++) {
result[currentIdx] = nums[i];
result[currentIdx+1] = nums[i+n];
currentIdx += 2;
}
return result;
}
}
沒有留言:
張貼留言