HashMap的几种遍历方式

package com.lin.test;


import java.util.HashMap;
import java.util.Iterator;
import java.util.Map;
import java.util.Map.Entry;


public class BianLi {


public static void main(String[] args){
HashMap<Integer,String> hs = new HashMap<Integer,String>();
hs.put(11,"序号："+11);
int i = 0;
while(i < 11){
hs.put(i, "序号："+i);
i++;
}

// //遍历方式1：
// for(Entry<Integer, String> entry:hs.entrySet()){
// System.out.println("key:"+entry.getKey()+" "+"value:"+entry.getValue());
// }
//
// //遍历方式2：
// Iterator<Map.Entry<Integer, String>> iterator = hs.entrySet().iterator();
// while(iterator.hasNext()){
// Entry<Integer, String> entry = iterator.next();
// System.out.println("key:"+entry.getKey()+" value:"+entry.getValue());
// }

// //遍历方式3：
// for(Integer key:hs.keySet()){
// System.out.println("key:"+key+" value"+hs.get(key));
// }

//遍历方式4：
Iterator iterator = hs.keySet().iterator();
while(iterator.hasNext()){
Integer key = (Integer) iterator.next();
System.out.println("key:"+key+" value:"+hs.get(key));
}

}

}