zoukankan      html  css  js  c++  java
  • 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);
    }

    }

  • 相关阅读:
    vuejs 踩坑及经验总结
    Factory Method
    【Java】macOS下编译JDK8
    康威定律(Conway's law)
    first-child和first-of-type
    JavaScript 核心学习——继承
    All Tips
    21分钟教会你分析MaxCompute账单
    CTO职场解惑指南系列(一)
    威胁预警|首现新型RDPMiner挖矿蠕虫 受害主机易被添加恶意账户
  • 原文地址:https://www.cnblogs.com/liubaihui/p/8777137.html
Copyright © 2011-2022 走看看