LeetCode: Running Sum of 1D Array
Problem: Running Sum of 1D Array
class Solution:
def runningSum(self, nums: List[int]) -> List[int]:
if len(nums)<=1:
return nums
new_nums=[]
total=0
for num in nums:
total+=num
...
is-power-of-two.hashnode.dev1 min read