zoukankan      html  css  js  c++  java
  • Map遍历方法

    我们经常用到Map集合,往往需要遍历它,下面记录几种遍历Map的方法:

    import java.util.HashMap;
    import java.util.Iterator;
    import java.util.Map;
    import java.util.Map.Entry;
    import java.util.Set;
    
    
    public class MapTest {
    
        /**
         * @param args
         */
        public static void main(String[] args) {
            Map<String, String> map = new HashMap<String, String>();
            map.put("key1", "value1");
            map.put("key2", "value2");
            map.put("key3", "value3");
            //Map遍历方法1
            System.out.println("Map遍历方法1");
            Set<String> set = map.keySet();
            for (String string : set) {
                System.out.println(string + " = " + map.get(string));
            }
            //Map遍历方法2
            System.out.println("Map遍历方法2");
            Set<Entry<String, String>> entries = map.entrySet();
            for (Entry<String, String> entry : entries) {
                System.out.println(entry.getKey() + " = " + entry.getValue());
            }
            //Map遍历方法3
            System.out.println("Map遍历方法3");
            Iterator<String> iterator = map.keySet().iterator();
            while (iterator.hasNext()) {
                String string = (String) iterator.next();
                System.out.println(string + " = " + map.get(string));
            }
            //Map遍历方法4
            System.out.println("Map遍历方法4");
            Iterator<String> iterator2 = map.values().iterator();
            while (iterator2.hasNext()) {
                String string = (String) iterator2.next();
                System.out.println(string);
            }
        }
    
    }
  • 相关阅读:
    ST (Sparse Table:稀疏表)算法
    P3379 【模板】最近公共祖先(LCA)
    AT1357 n^p mod m(洛谷)
    poj2018 Best Cow Fences
    P1024 一元三次方程求解
    poj2456
    poj1064
    P2047 [NOI2007]社交网络(洛谷)
    poj1734
    洛谷P2886 [USACO07NOV]牛继电器Cow Relays
  • 原文地址:https://www.cnblogs.com/ycclmy/p/3106013.html
Copyright © 2011-2022 走看看