FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
JavaProgramming/HackerRank/FiftyEight.java at main · karterhhgg/JavaProgramming · GitHub
karterhhgg
/
JavaProgramming
Public
Notifications
You must be signed in to change notification settings
Fork
8
Star
1
Code
Pull requests
6
Actions
Projects
Security and quality
0
Insights
Additional navigation options
Code
Pull requests
Actions
Projects
Security and quality
Insights
Expand file tree
Breadcrumbs
JavaProgramming
/
HackerRank
/
FiftyEight.java
Copy path
More file actions
More file actions
Latest commit
History
History
History
40 lines (31 loc) · 1012 Bytes
Breadcrumbs
JavaProgramming
/
HackerRank
/
FiftyEight.java
Copy path
File metadata and controls
40 lines (31 loc) · 1012 Bytes
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
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
package
HackerRank
;
import
java
.
io
.*;
import
java
.
util
.*;
import
java
.
text
.*;
import
java
.
math
.*;
import
java
.
util
.
regex
.*;
public
class
FiftyEight
{
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
=
sc
.
nextInt
();
// length of array
int
[]
arr
=
new
int
[
n
];
// Read array elements
for
(
int
i
=
0
;
i
<
n
;
i
++) {
arr
[
i
] =
sc
.
nextInt
();
}
int
count
=
0
;
// To count number of negative subarrays
// Loop through all possible subarrays
for
(
int
i
=
0
;
i
<
n
;
i
++) {
int
sum
=
0
;
for
(
int
j
=
i
;
j
<
n
;
j
++) {
sum
+=
arr
[
j
];
if
(
sum
<
0
) {
count
++;
}
}
}
System
.
out
.
println
(
count
);
sc
.
close
();
}
}
Back
|
FazBrowse Home
|
New Git URL