package
0.0.0-20241222011224-a7a70b17fd79
Repository: https://github.com/conorkenn/goleetcodehero.git
Documentation: pkg.go.dev

# README

1480. Running Sum of 1d Array

Given an array nums. We define a running sum of an array as runningSum[i] = sum(nums[0]…nums[i]).

Return the running sum of nums.

Example 1:

Input: nums = [1,2,3,4]
Output: [1,3,6,10]
Explanation: Running sum is obtained as follows: [1, 1+2, 1+2+3, 1+2+3+4].

Example 2:

Input: nums = [1,1,1,1,1]
Output: [1,2,3,4,5]
Explanation: Running sum is obtained as follows: [1, 1+1, 1+1+1, 1+1+1+1, 1+1+1+1+1].

Example 3:

Input: nums = [3,1,2,10,1]
Output: [3,4,6,16,17]

Constraints:

  • 1 <= nums.length <= 1000
  • -10^6 <= nums[i] <= 10^6

Answer

func runningSum(nums []int) []int {
    ans := []int{}
    runningSum := 0
    for _, num := range nums{
        runningSum += num
        ans = append(ans, runningSum)
    }
    return ans
}
  1. Initialize empty slice and variable to hold runningSum to zero
  2. Loop over nums add current num to runningSum and append to slice
  3. return slice