import java.sql.*;
import java.util.*;
public class Main {
public static void main(String[] args) throws Exception {
HashMap<String,Integer> map1 = new HashMap<>();
HashMap<Character,Integer> map2 = new HashMap<>();
Scanner sc = new Scanner(System.in);
while (sc.hasNext())
{
String str = sc.next().toUpperCase();
if(str.equals("0000")) break;
int cnt1 = map1.getOrDefault(str,0);
map1.put(str,cnt1+1);
for(int i=0;i<str.length();i++)
{
char x = str.charAt(i);
int cnt2 = map2.getOrDefault(x,0);
map2.put(x,cnt2+1);
}
}
int maxx=-9999;
int minn = 9999;
String str1=null,str2=null;
for(Map.Entry<String,Integer> entry: map1.entrySet())
{
if(entry.getValue()>maxx)
{
maxx= entry.getValue();
str1 = entry.getKey();
}
if(entry.getValue()==maxx)
{
if(entry.getKey().compareTo(str1)>0)
{
str1= entry.getKey();
}
}
if(entry.getValue()<minn)
{
minn= entry.getValue();
str2 = entry.getKey();
}
if(entry.getValue()==minn)
{
if(entry.getKey().compareTo(str2)<0)
{
str2 = entry.getKey();
}
}
}
System.out.printf("%-10s%8d\n",str1,maxx);
System.out.printf("%-10s%8d\n",str2,minn);
for(int i='A';i<='Z';i++)
{
char x = (char) i;
if(map2.get(x)==null)
{
System.out.printf("%-10c%8d\n",x,0);
}
else{
System.out.printf("%-10c%8d\n",x,map2.get(x));
}
}
}
}
7-7 sdut-Map(dict)-String--单词和字符鉴别器
最新推荐文章于 2024-10-09 23:44:37 发布
该篇文章详细描述了一个Java程序,使用HashMap对用户输入的字符串进行字符计数,并找出出现次数最多和最少的字符,以及每个ASCII字符的出现次数。
摘要由CSDN通过智能技术生成