- Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathHackerrankJava0029.java
More file actions
Latest commit
42 lines (32 loc) · 920 Bytes
/
Copy pathHackerrankJava0029.java
File metadata and controls
42 lines (32 loc) · 920 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
importjava.util.ArrayList;
importjava.util.List;
importjava.util.Scanner;
publicclassHackerrankJava0029 {
publicstaticvoidmain(String[] args) {
// Java Subarray
// https://www.hackerrank.com/challenges/java-negative-subarray/problem?isFullScreen=true
Scannerscanner = newScanner(System.in);
intnumberOfValue = scanner.nextInt();
List<Integer> arr = newArrayList<>();
for (inti = 0; i < numberOfValue; i++) {
arr.add(scanner.nextInt());
}
printResult(arr);
scanner.close();
}
publicstaticvoidprintResult(List<Integer> arr) {
intnumberOfNegative = 0;
for (inti = 0; i < arr.size(); i++) {
for (intj = 1; j <= arr.size(); j++) {
inttoIndex = i + j;
if (toIndex > arr.size()) {
break;
}
if (arr.subList(i, toIndex).stream().reduce(0, (a, b) -> a + b) < 0) {
numberOfNegative++;
}
}
}
System.out.println(numberOfNegative);
}
}