-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathJava Subarray.java
43 lines (42 loc) · 1.41 KB
/
Java Subarray.java
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
import java.io.*;
import java.util.*;
// Java 8
public class Solution {
public static void main(String[] args) {
/* Enter your code here. Read input from STDIN. Print output to STDOUT. Your class should be named Solution. */
Scanner sc = new Scanner(System.in);
int n = Integer.parseInt(sc.nextLine());
int [] numbers = Arrays.stream(sc.nextLine().split(" ")).mapToInt(Integer::parseInt).toArray();
int negCount = 0;
for(int i = 0; i < n; i++){
for(int j = i; j < n; j++){
int subArr[] = null;
/*if(i == j){
subArr = new int[1];
subArr[0] = numbers[i];
}
else *///if(i <= j)
subArr = Arrays.copyOfRange(numbers, i, j+1);
//System.err.println(Arrays.toString(subArr));
int sum = sumArray(subArr);
//System.err.println("Sum = "+sum);
if(sum < 0){
negCount++;
//System.err.println("Range = ["+i+":"+j+"]");
}
}
}
System.out.println(negCount);
sc.close();
}
public static int sumArray(int [] arr){
int sum = 0;
if(arr != null){
for(int i = 0; i < arr.length; i++){
sum+=arr[i];
}
}
return sum;
}
}
// Have a nice day.