2020-11-01

Map判定各字符出现总数

public static void main(String[] args) {
String str = “woaiheimawoaijavawoaichaunzhi”;
//将字符串转换为字符数组
char[] chars = str.toCharArray();
//创建map对象，字符为键，个数为值
HashMap<Character,Integer> hashMap = new HashMap<>();
//遍历赋值
for (int i = 0; i < chars.length; i++) {
//判断数组中是否存在并对个数+1，不存在赋值为1
if (hashMap.containsKey(chars[i])){
int i1 = hashMap.get(chars[i]) + 1;
hashMap.put(chars[i],i1);
}else {
hashMap.put(chars[i],1);
}
}
//遍历输出
hashMap.forEach((k,v)->{
System.out.println(k+"–"+v+“个”);
});
}