From 1dae6367a7a27c8d4a7c24ed01040b8f59beee34 Mon Sep 17 00:00:00 2001 From: Deven <63876261+devenperez@users.noreply.github.com> Date: Mon, 19 Sep 2022 13:57:23 -0400 Subject: [PATCH] Create README - LeetHub --- 1480-running-sum-of-1d-array/README.md | 30 ++++++++++++++++++++++++++ 1 file changed, 30 insertions(+) create mode 100644 1480-running-sum-of-1d-array/README.md diff --git a/1480-running-sum-of-1d-array/README.md b/1480-running-sum-of-1d-array/README.md new file mode 100644 index 0000000..482ee91 --- /dev/null +++ b/1480-running-sum-of-1d-array/README.md @@ -0,0 +1,30 @@ +
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