直接上代碼:
package linruozhuo;
import java.util.HashMap;
import java.util.Iterator;
import java.util.Map;
public class JavaJihe {
public static void main(String[] args) {
Map<String ,String > map1 = new HashMap<String ,String >();
map1.put("1", "小米");
map1.put("2", "小紅");
map1.put("3", "小明");
map1.put("4", "小華");
//通過鍵找值遍歷(效率低)
System.out.println("通過Map.keySet遍歷key和value:");
for (String key : map1.keySet()) {
System.out.println("key= "+ key + " and value= " + map1.get(key));
}
// Iterator遍歷
System.out.println("通過Iterator遍歷key和value:");
Iterator<Map.Entry<String,String >> entries = map1.entrySet().iterator();
while (entries.hasNext()) {
Map.Entry<String,String > entry = entries.next();
System.out.println("Key = " + entry.getKey() + ", Value = " + entry.getValue());
}
//foreach分別遍歷key和value
System.out.println("foreach分別遍歷key和value:");
for (String key : map1.keySet()) {
System.out.println("key= "+ key);
}
for (String value : map1.values()) {
System.out.println("value= "+ value);
}
//for循環
System.out.println("for遍歷key和value:");
for (int i = 1; i <= map1.size(); i++) {
String key = i+"";
System.out.println("key= "+ (i) + " and value= " + map1.get(key));
}
}
}