1480. Running Sum of 1d Array (List Comprehension)

Difficulty: Easy 
53 / 53 test cases passed.
Runtime: 48 ms
Memory Usage: 14 MB

Author: YuriSpiridonov

Easy/1480.RunningSumof1dArray(ListComprehension).py

@@ -0,0 +1,26 @@
+"""
+    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:
+    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].
+    
+    Constraints:
+        - 1 <= nums.length <= 1000
+        - -10^6 <= nums[i] <= 10^6
+"""
+#Difficulty: Easy 
+#53 / 53 test cases passed.
+#Runtime: 48 ms
+#Memory Usage: 14 MB
+    
+#Runtime: 48 ms, faster than 55.37% of Python3 online submissions for Running Sum of 1d Array.
+#Memory Usage: 14 MB, less than 100.00% of Python3 online submissions for Running Sum of 1d Array.
+    
+class Solution:
+    def runningSum(self, nums: List[int]) -> List[int]:
+        return [sum(nums[:i]) for i in range(1, len(nums)+1)]