|
| 1 | +<h2><a href="https://leetcode.com/problems/running-sum-of-1d-array/">1480. Running Sum of 1d Array</a></h2><h3>Easy</h3><hr><div><p>Given an array <code>nums</code>. We define a running sum of an array as <code>runningSum[i] = sum(nums[0]...nums[i])</code>.</p> |
| 2 | + |
| 3 | +<p>Return the running sum of <code>nums</code>.</p> |
| 4 | + |
| 5 | +<p> </p> |
| 6 | +<p><strong class="example">Example 1:</strong></p> |
| 7 | + |
| 8 | +<pre><strong>Input:</strong> nums = [1,2,3,4] |
| 9 | +<strong>Output:</strong> [1,3,6,10] |
| 10 | +<strong>Explanation:</strong> Running sum is obtained as follows: [1, 1+2, 1+2+3, 1+2+3+4].</pre> |
| 11 | + |
| 12 | +<p><strong class="example">Example 2:</strong></p> |
| 13 | + |
| 14 | +<pre><strong>Input:</strong> nums = [1,1,1,1,1] |
| 15 | +<strong>Output:</strong> [1,2,3,4,5] |
| 16 | +<strong>Explanation:</strong> Running sum is obtained as follows: [1, 1+1, 1+1+1, 1+1+1+1, 1+1+1+1+1].</pre> |
| 17 | + |
| 18 | +<p><strong class="example">Example 3:</strong></p> |
| 19 | + |
| 20 | +<pre><strong>Input:</strong> nums = [3,1,2,10,1] |
| 21 | +<strong>Output:</strong> [3,4,6,16,17] |
| 22 | +</pre> |
| 23 | + |
| 24 | +<p> </p> |
| 25 | +<p><strong>Constraints:</strong></p> |
| 26 | + |
| 27 | +<ul> |
| 28 | + <li><code>1 <= nums.length <= 1000</code></li> |
| 29 | + <li><code>-10^6 <= nums[i] <= 10^6</code></li> |
| 30 | +</ul></div> |
0 commit comments