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;
    }
}

What to read next

Previous / Next
Previous: LeetCode - 洗牌陣列 Next: LeetCode - 擁有最多糖果的小孩
More like this
Subscribe via RSS: Macro · Tech