LeetCode --- 1480. Running Sum of 1d Array 解题报告
Posted 杨鑫newlfe
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了LeetCode --- 1480. Running Sum of 1d Array 解题报告相关的知识,希望对你有一定的参考价值。
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] &
以上是关于LeetCode --- 1480. Running Sum of 1d Array 解题报告的主要内容,如果未能解决你的问题,请参考以下文章
LeetCode 1480 一维数组的动态和[数学] HERODING的LeetCode之路
LeetCode --- 1480. Running Sum of 1d Array 解题报告
LeetCode --- 1480. Running Sum of 1d Array 解题报告
LeetCode 1480. 一维数组的动态和 / 1588. 所有奇数长度子数组的和 / 528. 按权重随机选择(随机化)