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].

类似于图像中的积分数组，i 处为0～i 为止的元素和。

思路：
DP

public int[] runningSum(int[] nums) {
    int n = nums.length;
    int[] res = new int[n];
    res[0] = nums[0];
    
    for(int i = 1; i < n; i ++) {
       res[i] = res[i-1] + nums[i]; 
    }
    return res;
}