LanQiaoTestCodes/字符统计2.java

36 lines
700 B
Java
Raw Permalink Normal View History

2023-04-23 12:30:47 +00:00
package LanQiaoOJ;
import java.util.ArrayList;
import java.util.Scanner;
public class <EFBFBD>ַ<EFBFBD>ͳ<EFBFBD><EFBFBD>2 {
static int[] a=new int[26];
public static void main(String[] args) {
Scanner sc=new Scanner(System.in);
String s=sc.next();
//<2F><>Ҫһ<D2AA><D2BB><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ȥͳ<C8A5><CDB3>ÿ<EFBFBD><C3BF><EFBFBD>ַ<EFBFBD><D6B7><EFBFBD><EFBFBD>ֵĴ<D6B5><C4B4><EFBFBD>
for(int i=0;i<s.length();i++) {
//<2F><>¼<EFBFBD><C2BC><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ַ<EFBFBD><D6B7>ij<EFBFBD><C4B3>ִ<EFBFBD><D6B4><EFBFBD>+-
char c=s.charAt(i);
a[c-'A']++;
}
//<2F><><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
ArrayList<Integer>list=new ArrayList<>();
int max=0;
for(int i=0;i<26;i++) {
if(a[i]>max) {
list.clear();
max=a[i];
list.add(i);
}else if(a[i]==max) {
list.add(i);
}
}
for(int i:list) {
System.out.print((char)(i+'A'));
}
}
}