zoukankan      html  css  js  c++  java
  • java Map 怎么遍历

    //最常规的一种遍历方法,最常规就是最常用的,虽然不复杂,但很重要,这是我们最熟悉的,就不多说了!!
        public static void work(Map<String, Student> map) {
            Collection<Student> c = map.values();
            Iterator it = c.iterator();
            for (; it.hasNext();) {
                System.out.println(it.next());
            }
        }
      //利用keyset进行遍历,它的优点在于可以根据你所想要的key值得到你想要的 values,更具灵活性!!
        public static void workByKeySet(Map<String, Student> map) {
            Set<String> key = map.keySet();
            for (Iterator it = key.iterator(); it.hasNext();) {
                String s = (String) it.next();
                System.out.println(map.get(s));
            }
        }
      //比较复杂的一种遍历在这里,呵呵~~他很暴力哦,它的灵活性太强了,想得到什么就能得到什么~~
        public static void workByEntry(Map<String, Student> map) {
            Set<Map.Entry<String, Student>> set = map.entrySet();
            for (Iterator<Map.Entry<String, Student>> it = set.iterator(); it.hasNext();) {
                Map.Entry<String, Student> entry = (Map.Entry<String, Student>) it.next();
                System.out.println(entry.getKey() + "--->" + entry.getValue());
            }
        }
    }
  • 相关阅读:
    hdu.1226.超级密码(bfs)
    zstu.2512. Moving Tables(贪心)
    zoj.3868.GCD Expectation(数学推导>>容斥原理)
    acdream.LCM Challenge(数学推导)
    acdream.Triangles(数学推导)
    acdream.A Very Easy Triangle Counting Game(数学推导)
    acdream.Bet(数学推导)
    acdream.郭式树(数学推导)
    EntityFramework(转自wiki)
    石墨烯(转自wiki)
  • 原文地址:https://www.cnblogs.com/huapox/p/3516344.html
Copyright © 2011-2022 走看看