Leetcode 1480 - Running Sum of 1d Array solution

To solve this problem we are storing the summation in place.

class Solution:
    def runningSum(self, nums: List[int]) -> List[int]:
        for i in range(1, len(nums)):
            nums[i] = nums[i] + nums[i-1]
            
        return nums

class Solution {
   public int[] runningSum(int[] nums) {
       for(int i = 1; i < nums.length; i++){
           nums[i] = nums[i] + nums[i-1];
       }
       return nums;
   }
}

Time complexity: O(n) Space complexity: O(n)