[LeetCode/Easy] 1480. Running Sum of 1d Array

1. Input

1) 정수 배열 nums

 

2. Output

1) 아래 정의대로 만든 배열 runningSum

- 정의: runningSum[i] = sum(nums[0]…nums[i])

 

3. Constraint

1) 1 <= nums.length <= 1000

2) - 10^6 <= nums[i] <= 10^6

 

4. Example

Input: nums = [1,2,3,4] -> Output: [1,3,6,10]

설명:

- runningSum[0] = nums[0] = 1

- runningSum[1] = nums[0] + nums[1] = 1 + 2 = 3

- runningSum[2] = nums[0] + nums[1] + nums[2] = 1 + 2 + 3 = 6

- runningSum[3] = nums[0] + nums[1] + nums[2] + nums[3] = 1 + 2 + 3 + 4= 10

 

5. Code

1) 첫 코드(2022/06/01)

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