map遍历方式

map遍历方式

第一种:

public class Test1 {

public static void main(String[] args) throws Throwable {
Map<String, Integer> map=new HashMap<>();
String[] strings={"abc","bb","cc","abc","b","cc"};
int count=0;
for(int i=0;i<strings.length-1;i++){
if (map.containsKey(strings[i])) {
map.put(strings[i],map.get(strings[i])+1);
}else {
map.put(strings[i],1);
}
}

Iterator<Entry<String, Integer>> iterator = map.entrySet().iterator();

while (iterator.hasNext()) {
Entry<String, Integer> next = iterator.next();
System.out.println(next.getKey()+"----"+next.getValue());
}
}

第二种遍历方式

public class Test1 {

public static void main(String[] args) throws Throwable {
Map<String, Integer> map=new HashMap<>();
map.put("小米", 1);
map.put("苹果", 2);

Iterator<String> iterator = map.keySet().iterator();
while (iterator.hasNext()) {
String next = iterator.next();
Integer integer = map.get(next);

System.out.println(next+"---"+integer);

}

第三种 增强for循环

public class Test1 {

public static void main(String[] args) throws Throwable {
Map<String, Integer> map=new HashMap<>();
map.put("小米", 1);
map.put("苹果", 2);

for (Map.Entry<String, Integer> string : map.entrySet()) {
String key = string.getKey();
Integer value = string.getValue();
System.out.println(key+"--"+value);
}

}

原文地址:https://www.cnblogs.com/liubaihui/p/8777137.html