meituan-013. 偏爱字母

This commit is contained in:
huangge1199@hotmail.com 2021-08-29 21:44:34 +08:00
parent 48d45fc27b
commit 63dca39534

View File

@ -0,0 +1,74 @@
package study.plan.meituan.meituan013;
import java.io.*;
import java.util.StringTokenizer;
class Solution {
static Scanner sc;
static PrintWriter pw;
public static void main(String[] args) throws IOException {
sc = new Scanner(System.in);
pw = new PrintWriter(System.out);
solve();
pw.close();
}
public static void solve() throws IOException {
int n = sc.nextInt();
String str = sc.next();
int count=0;
int cur = 0;
for (char ch :str.toCharArray()){
if(ch=='E'){
cur++;
count = Math.max(cur,count);
}else{
cur--;
cur = Math.max(cur,0);
}
}
pw.println(count);
}
static class Scanner {
BufferedReader br;
StringTokenizer st;
public Scanner(InputStream s) {
br = new BufferedReader(new InputStreamReader(s));
}
public Scanner(FileReader f) {
br = new BufferedReader(f);
}
public String next() throws IOException {
while (st == null || !st.hasMoreTokens())
st = new StringTokenizer(br.readLine());
return st.nextToken();
}
public int nextInt() throws IOException {
return Integer.parseInt(next());
}
public long nextLong() throws IOException {
return Long.parseLong(next());
}
public double nextDouble() throws IOException {
return Double.parseDouble(next());
}
public int[] nextIntArr(int n) throws IOException {
int[] arr = new int[n];
for (int i = 0; i < n; i++) {
arr[i] = Integer.parseInt(next());
}
return arr;
}
}
}