LeetCode - 1480. Running Sum of 1d Array(Array, PrefixSum)

문제

지정된 배열 번호입니다. 어레이의 실행 합계를 Sum[i] = sum(nums[0]…nums[i])으로 정의합니다.
https://leetcode.com/problems/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]

풀이

class Solution {
    public int[] runningSum(int[] nums) {
        if(nums.length==1)return nums;
        
        for(int i=1;i<nums.length;i++){
            nums[i]=nums[i-1]+nums[i];
        }
        
        return nums;
    }
}