迭代Map的正确方法

1. 最常见的用法

public static void main(String[] args) {

Map<String, String> keyMap = new HashMap<String, String>();
keyMap.put(“a”, “A”);
keyMap.put(“b”, “B”);
keyMap.put(“c”, “C”);
String keyUpper ;
String key;

for (String key : keyMap.keySet()) {

keyUpper = keyMap.get(key);
System.out.println(keyUpper+":"+key );

}

}

 

该方法访问了一个map的entry 应该使用keySet上面的迭代器。在Map的EntrySet上使用迭代器来避免在使用Map.get(key)是更有效率的

2. 在keySet()上使用迭代器可以使得到key的效率加快，但如果这个时候要访问值，则并非最快的

public static void main(String[] args) {

Map<String, String> keyMap = new HashMap<String, String>();
keyMap.put(“a”, “A”);
keyMap.put(“b”, “B”);
keyMap.put(“c”, “C”);
String keyUpper ;
String key;
Iterator<String> iterator = keyMap.keySet().iterator();
while (iterator.hasNext()) {

key = iterator.next();
keyUpper = keyMap.get(key);
System.out.println(keyUpper+":"+key );

}

}

3. 使用map 的 entrySet() 遍历的key和值的效率是最快的

public static void main(String[] args) {

Map<String, String> keyMap = new HashMap<String, String>();
keyMap.put(“a”, “A”);
keyMap.put(“b”, “B”);
keyMap.put(“c”, “C”);
String keyUpper ;
String key;
Entry<String, String> entry;
Iterator<Entry<String, String>> iterator = keyMap.entrySet().iterator();
while (iterator.hasNext()) {

entry = iterator.next();
key = entry.getKey();
keyUpper = entry.getValue();
System.out.println(keyUpper+":"+key );

}

}