-
Notifications
You must be signed in to change notification settings - Fork 25
/
1480-running-sum-of-1d-array.js
49 lines (40 loc) · 1.02 KB
/
1480-running-sum-of-1d-array.js
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
// 1480. Running Sum of 1d Array
// Easy 95%
// 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
/**
* @param {number[]} nums
* @return {number[]}
*/
const runningSum = function(nums) {
for (let i = 1; i < nums.length; i++) {
nums[i] += nums[i - 1]
}
return nums
}
;[
[1,2,3,4],
[1,1,1,1,1],
[3,1,2,10,1]
].forEach((nums) => {
console.log(runningSum(nums))
})
// Solution:
// 遍历数组,让 nums[i] = nums[i] + nums[i - 1] 即可。
// Submission Result: Accepted