-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathRunningSum.java
More file actions
47 lines (43 loc) · 1.08 KB
/
Copy pathRunningSum.java
File metadata and controls
47 lines (43 loc) · 1.08 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
//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
import java.util.Arrays;
public class RunningSum {
public int[] runningSum(int[] nums) {
int[] runningSum = new int[nums.length];
int sum = 0;
for(int i = 0; i < runningSum.length; i++){
sum += nums[i];
runningSum[i] = sum;
}
return runningSum;
}
public static void main(String[] args) {
RunningSum rs = new RunningSum();
int[] nums = {1, 2, 3, 4};
System.out.println(Arrays.toString(rs.runningSum(nums)));
}
}