给定一系列字符串:
“chenhao”
“zhangsan”
“zhangsan”
“chenhao”
“lisi”
“wangwu”
“zhaoliu”
“xiaoqiang”
“haha”
打印输出各个字符串出现的次数(使用HashMap实现,键保存字符串,
值保存保存出现的次数)
复杂的
package Test3_30.t4;
import java.util.HashMap;
import java.util.Map;
public class test4 {
public static void main(String[] args) {
String[] s = new String[]{"chenhao", "zhangsan", "zhangsan", "chenhao", "lisi", "wangwu", "zhaoliu", "xiaoqiang", "haha"};
HashMap<String, Integer> hashMap = new HashMap<>();
for (int i = 0; i < s.length; i++) {
Integer count=0;
for (int j = 0; j < s.length; j++) {
if (s[i].equals(s[j])){
count++;
hashMap.put(s[i],count);
}
}
}
for (Map.Entry<String, Integer> entry : hashMap.entrySet()) {
System.out.println(entry);
}
}
}
条理清晰,完美的
package test3_31.t3;
import java.util.HashMap;
import java.util.Map;
/*
给定一系列字符串:
"chenhao"
"zhangsan"
"zhangsan"
"chenhao"
"lisi"
"wangwu"
"zhaoliu"
"xiaoqiang"
"haha"
打印输出各个字符串出现的次数(使用HashMap实现,键保存字符串,
值保存保存出现的次数)
*/
public class test3 {
public static void main(String[] args) {
HashMap<String, Integer> map = new HashMap<>();
//创建字符串数组
String[] arr = new String[]{"chenhao",
"zhangsan",
"zhangsan",
"chenhao",
"lisi",
"wangwu",
"zhaoliu",
"xiaoqiang",
"haha"};
//遍历数组,放入Map
for (String key : arr) {
if (map.containsKey(key)){
//如果包含key,value+1
Integer integer = map.get(key)+1;
map.put(key,integer);
}else {
//不包含的话直接放入,value值为1
map.put(key,1);
}
}
//打印各个字符串出现的次数
for (Map.Entry<String, Integer> entry : map.entrySet()) {
System.out.println(entry);
}
}
}