LeetCode

程式碼
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;
    }
}

接下來看什麼

上一篇 / 下一篇
上一篇:leetcode - Running Sum of 1d Array 下一篇:leetcode - Shuffle the Array
延伸閱讀
訂閱 RSS: 總經 · 技術