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());
        }
    }

例子：

public static void main(String[] args) {
		TreeMap<Integer, String> maps = new TreeMap<Integer, String>();
		maps.put(3, "王五");
		maps.put(1, "张三");
		maps.put(2, "李四");
		maps.put(4, "赵六");

		int size = maps.size();
		int count = 0;
		Set set = maps.keySet();
		Iterator iter = set.iterator();
		while (iter.hasNext()) {
			Object key = iter.next();
			if (count >= (size - 2)) {
				System.out.println(key + " " + maps.get(key));
			}
			count++;
		}

	}