package map;
import java.util.HashMap;
import java.util.Iterator;
import java.util.Map;
import java.util.Set;
import java.util.Map.Entry;
public class Count {
public static void main(String[] args) {
//手动输入一个字符串
String s ="aaaaaaasdgslhjpwretjhwertkhoiwrjtgpoqkerpogjapdsgjkwerjg";
//创建一个Map集合来存储 字符和出现的次数
Map<Character,Integer> m = new HashMap<>();
//for循环来遍历判断各个字符的出现的次数
for (int i = 0; i < s.length(); i++) {
int count=0;
char c= s.charAt(i);
if(m.containsKey(c)){
m.put(c,m.get(c)+1);
}else{
m.put(c, 1);
}
}
//迭代输出
Set<Map.Entry<Character, Integer>> ss= m.entrySet();
Iterator<Entry<Character, Integer>> it = ss.iterator();
while(it.hasNext()){
Entry<Character, Integer> e = it.next();
System.out.print(e+" ");
}
}
}
运行结果如下: