String s = "qwertyuoasdagfqwterwerwyrt";
char[] chars = s.toCharArray();
Map<Character, Integer> map = new HashMap<>();
//第一种直接用map集合
for (int i = 0; i < chars.length; i++) {
if (map.keySet().contains(chars[i])){
map.put(chars[i], map.get(chars[i])+1);
}else {
map.put(chars[i],1);
}
}
map.forEach((k,v)->{
System.out.println(k+" "+v);
});
//第二种先用Set去重,再把遍历的给到map集合
Set<Character> set = new HashSet<>();
for (char c : chars) {
set.add(c);
}
for (Character character : set) {
int count = 0;
for (char c : chars) {
if (character.equals(c)) {
count++;
}
}
map.put(character, count);
}
map.forEach((k, v) -> {
System.out.println(k + "出现了" + v + "次");
});