[array]1480. Running Sum of 1d Array

1480. Running Sum of 1d Array

Description :
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] <= 10^6

Hint1
Think about how we can calculate the i-th number in the running sum from the (i-1)-th number.

solution1 原地修改

思路和算法

因为有 \textit{runningSum}[i] = \sum_{i=0}^{i} \textit{nums}[i]runningSum[i]=∑
i=0
i

nums[i]。

可以推导出：

\textit{runningSum}[i] = \begin{cases} \textit{nums}[0], &i = 0 \ \textit{runningSum}[i-1] + \textit{nums}[i], &i > 0 \end{cases}
runningSum[i]={
nums[0],
runningSum[i−1]+nums[i],

i=0
i>0

这样我们可以从下标 11 开始遍历 \textit{nums}nums 数组，每次让 \textit{nums}[i]nums[i] 变为 \textit{nums}[i-1] + \textit{nums}[i]nums[i−1]+nums[i] 即可（因为此时的 \textit{nums}[i-1]nums[i−1] 即为 \textit{runningSum}[i-1]runningSum[i−1]）。

代码

class Solution {
public:
vector<int> runningSum(vector<int>& nums) {
int n = nums.size();
for (int i = 1; i < n; i++) {
            nums[i] += nums[i - 1];
        }
return nums;
    }
};

复杂度分析

时间复杂度：O(n)O(n)，其中 nn 是给定数组长度。

空间复杂度：O(1)O(1)。我们只需要常数的空间保存若干变量。

作者：LeetCode-Solution
链接：https://leetcode.cn/problems/running-sum-of-1d-array/solution/yi-wei-shu-zu-de-dong-tai-he-by-leetcode-flkm/
来源：力扣（LeetCode）
著作权归作者所有。商业转载请联系作者获得授权，非商业转载请注明出处。