1480. Running Sum of 1d Array - leetcode solution

 class Solution {

    public int[] runningSum(int[] nums) {

        for(int idx = 1; idx<nums.length; idx++) {

            nums[idx] = nums[idx-1] + nums[idx];

        }

        return nums;

    }

}