LeetCode #1480. Running Sum of 1d Array

题目

1480. Running Sum of 1d Array

---

解题方法

简单的动态规划题。
时间复杂度：O(n)
空间复杂度：O(1)

---

代码

class Solution:
    def runningSum(self, nums: List[int]) -> List[int]:
        for i in range(1, len(nums)):
            nums[i] += nums[i-1]
        return nums