Skip to main content

< Back to Data Structures and Algorithms

LeetCode 1480 · Arrays

Running Sum of 1d Array

Each number replaced, in place, by the total of it and everything before it.

Step through it

Examples
Edge cases
nums
  1. 10
  2. 21
  3. 32
  4. 43

Step 0 of 13

Output

Running… play or step to the end.

The code

/**
 * Converts an array of numbers into a running sum array
 * For example: [1, 1, 1, 1, 1] becomes [1, 2, 3, 4, 5]
 *              [1, 2, 3, 4]    becomes [1, 3, 6, 10]
 *
 * @param {number[]} nums
 * @return {number[]}
 */
 const runningSum = nums => {
    // O(n) loop over every item within the array, starting at the second index.
    for (let i=1; i < nums.length; i++) {
        // Mutate the array by adding the previous value to the current value.
        nums[i] += nums[i-1]
    }
    
    // Done iteration, return the running sum array.
    return nums
}

View it on GitHub (opens in a new tab)