leetcode-1480. 一维数组的动态和

1
2
3
4
5
6
7
8
9
10
11
class Solution {
    public int[] runningSum(int[] nums) {
        int n = nums.length;
        int[] dp = new int[n];
        dp[0] = nums[0];
        for (int i = 1; i < n; i++) {
            dp[i] = dp[i - 1] + nums[i];
        }
        return dp;
    }
}