-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathSubarraySum.java
More file actions
45 lines (34 loc) · 808 Bytes
/
Copy pathSubarraySum.java
File metadata and controls
45 lines (34 loc) · 808 Bytes
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
package array;
import java.util.Scanner;
public class SubarraySum {
public static int findSubarraySum(int[] arr, int start, int end) {
// make prefix sum array
int[] prefix = new int[arr.length];
prefix[0] = arr[0];
for (int i = 1; i < prefix.length; i++) {
prefix[i] = prefix[i - 1] + arr[i];
}
if (start == end || (start - 1) < 0) {
return prefix[end];
}
return prefix[end] - prefix[start - 1];
}
public static void main(String[] args) {
int[] arr = { 1, 2, 3, 4, 5 };
Scanner sc = new Scanner(System.in);
int queries = sc.nextInt();
for (int testcase = 0; testcase < queries; testcase++) {
int start = sc.nextInt();
int end = sc.nextInt();
System.out.println(findSubarraySum(arr, start, end));
}
sc.close();
}
}
/* test case-
4
0 2
1 4
2 4
1 1
*/