-
Notifications
You must be signed in to change notification settings - Fork 0
/
countingValleys.java
49 lines (38 loc) · 1.25 KB
/
countingValleys.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
44
45
46
47
48
49
import java.io.*;
import java.math.*;
import java.security.*;
import java.text.*;
import java.util.*;
import java.util.concurrent.*;
import java.util.regex.*;
public class Solution {
// Complete the countingValleys function below.
static int countingValleys(int n, String s) {
int diff=0;
int valleyCount=0;
char[] valleyChar=s.toCharArray();
for(char ch:valleyChar){
if('U'==ch){
diff+=1;
}else{
diff-=1;
if(diff==-1){
valleyCount+=1;
}
}
}
return valleyCount;
}
private static final Scanner scanner = new Scanner(System.in);
public static void main(String[] args) throws IOException {
BufferedWriter bufferedWriter = new BufferedWriter(new FileWriter(System.getenv("OUTPUT_PATH")));
int n = scanner.nextInt();
scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");
String s = scanner.nextLine();
int result = countingValleys(n, s);
bufferedWriter.write(String.valueOf(result));
bufferedWriter.newLine();
bufferedWriter.close();
scanner.close();
}
}