update

leetcode/problem/running-sum-of-1d-array.html

@@ -0,0 +1,33 @@
+<p>Given an array <code>nums</code>. We define a running sum of an array as&nbsp;<code>runningSum[i] = sum(nums[0]&hellip;nums[i])</code>.</p>
+
+
+
+<p>Return the running sum of <code>nums</code>.</p>
+
+
+
+<p>&nbsp;</p>
+
+<p><strong>Example 1:</strong></p>
+
+
+
+<pre>
+
+<strong>Input:</strong> nums = [1,2,3,4]
+
+<strong>Output:</strong> [1,3,6,10]
+
+<strong>Explanation:</strong> Running sum is obtained as follows: [1, 1+2, 1+2+3, 1+2+3+4].</pre>
+
+
+
+<p><strong>Example 2:</strong></p>
+
+
+
+<pre>
+
+<strong>Input:</strong> nums = [1,1,1,1,1]
+
+<strong>Output:</strong> [1,2,3,4,5]