zoukankan      html  css  js  c++  java
  • Map的迭代

     1 public static void main(String[] args) {
     2 
     3         Map<String, Integer> map = new HashMap<String, Integer>();
     4         map.put("张三", 12);
     5         map.put("张三1", 121);
     6         map.put("张三2", 122);
     7         map.put("张三3", 123);
     8         map.put("张三4", 124);
     9         map.put("张三5", 125);
    10         map.put("张三6", 126);
    11         map.put("张三7", 127);
    12 
    13         // keySet
    14         Set<String> set = map.keySet();
    15         Iterator<String> it = set.iterator();
    16         while (it.hasNext()) {
    17             String key = it.next();
    18             System.out.println(key + "---" + map.get(key));
    19         }
    20         System.out.println("==============================================");
    21         // foreach 遍历keySet
    22         for (String string : map.keySet()) {
    23             System.out.println(string + "===" + map.get(string));
    24         }
    25 
    26         System.out.println("==============================================");
    27 
    28         // entrySet
    29         Set<Entry<String, Integer>> setenty = map.entrySet();
    30         Iterator<Entry<String, Integer>> ite = setenty.iterator();
    31         while (ite.hasNext()) {
    32             Entry<String, Integer> m = ite.next();
    33             System.out.println(m.getKey() + "---" + m.getValue());
    34         }
    35         
    36         System.out.println("==============================================");
    37         
    38         // foreach 遍历entrySet
    39         for (Entry<String, Integer> entry : map.entrySet()) {
    40             System.out.println(entry.getKey() + "===" + entry.getValue());
    41         }
    42     }
  • 相关阅读:
    最小堆
    HDU1022+栈
    POJ2318+几何+判点在四边形内
    HDU1003+最大连续子序列和+起始终止位置
    HDU1174+三维点到直线距离
    HDU4517
    Two Phase Commit (2PC) [转]
    分布式系统领域经典论文翻译集 [转]银河里的星星
    每个程序员都应该知道的8个LINUX命令 [转]
    Google File System解析 [转]
  • 原文地址:https://www.cnblogs.com/caixiaohua/p/6700289.html
Copyright © 2011-2022 走看看