package *.collections;//包名
import java.util.Arrays;
import java.util.HashMap;
import java.util.Map;
import java.util.Set;
public class HomeWork6 {
/*6 ."good good study , day day up",
使用map统计该字符串中出现的字符及个数,并打印
如:g=2
0=4
*/
public static void main(String[] args) {
Map<Character,Integer> map = new HashMap<>();
//要测试的字符串
String s = "good good study day day up";
char[] s1 = s.toCharArray();
System.out.println(Arrays.toString(s1));
//判断当前的key是否存在,存在给加1,不存在给1
for (int i =0;i < s1.length; i++){
//和三目二选一
// if(!map.containsKey(s1[i])){
// map.put(s1[i],1);
// }else {
// map.put(s1[i],map.get(s1[i]) + 1);
// }
//三目
map.put(s1[i], map.containsKey(s1[i]) ? map.get(s1[i])+1: 1);
}
System.out.println(map);
//遍历
Set<Map.Entry<Character,Integer>> entries = map.entrySet();
for (Map.Entry<Character,Integer> o:entries){
System.out.println(o);
}
}
}
结果: