题目
解题方法
简单的动态规划题。
时间复杂度：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
相关文章
- 12-20[leetcode] 410. Split Array Largest Sum
- 12-20【leetcode_easy_greedy】1005. Maximize Sum Of Array After K Negations
- 12-20Leetcode167-Two Sum II Input array is sorted-Easy
- 12-20leetcode算法：Two Sum II - Input array is sorted
- 12-20【leetcode_easy_array】1013. Partition Array Into Three Parts With Equal Sum
- 12-20Leetcode-167. Two Sum II - Input array is sorted
- 12-20[LeetCode] 1005. Maximize Sum Of Array After K Negations
- 12-20(双指针 二分) leetcode 167. Two Sum II - Input array is sorted
- 12-20No.281 - LeetCode[1013] Partition Array Into Three Parts With Equal Sum - 三子串和相等
- 12-20Leetcode 167：Two Sum II - Input array is sorted