LeetCode

Code
class Solution {
    public int[] runningSum(int[] nums) {
        int[] result = new int[nums.length];
        for (int i = 0; i < nums.length; i++) {
            if (i == 0) {
                result[i] = nums[i];
            } else {
                result[i] = result[i-1] + nums[i];
            }
        }
        return result;
    }
}

What to read next

Previous / Next
Previous: LeetCode - 一維陣列的累加和 Next: LeetCode - 洗牌陣列
More like this
Subscribe via RSS: Macro · Tech