遍歷HashMap的兩種方式

文章轉自：http://blog.csdn.net/jinbogameboy/article/details/7183688

package hashmap.traverse;

import java.util.HashMap;
import java.util.Iterator;
import java.util.Calendar;

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

public class HashMapTest {
    public static void main(String[] args) {
        HashMap<Integer, String> hashMap = new HashMap<Integer, String>();
        for (int i = 0; i < 1000; i++) {
            hashMap.put(i, "Hello");
        }
        System.out.println("第一種遍歷方式:用key找值");
        Iterator<Integer> ite1 = hashMap.keySet().iterator();
        while (ite1.hasNext()) {
            String value = hashMap.get(ite1.next());
            System.out.println(value);
        }

        System.out.println("第二種遍歷方式：用Map.Entry找值");
        Iterator<Map.Entry<Integer, String>> ite2 = hashMap.entrySet()
                .iterator();
        while (ite2.hasNext()) {
            Map.Entry<Integer, String> entry = ite2.next();
            System.out.println(entry.getValue());
        }
    }
}