LinkedHashMap & TreeMap

LinkedHashMap和TreeMap都是有序的，不同的是LinkedHashMap的有序是指插入元素的先后顺序，TreeMap是指key值的有序性

import java.util.Iterator;
import java.util.LinkedHashMap;
import java.util.Map.Entry;
import java.util.TreeMap;

public class TestMap {

	public static void main(String[] args) {
		LinkedHashMap<String, Object> m1 = new LinkedHashMap<String, Object>();
		m1.put("1", 1);
		m1.put("3", 3);
		m1.put("2", 2);
		m1.put("5", 5);
		m1.put("4", 4);
		
		TreeMap<String, Object> m2 = new TreeMap<String, Object>();
		m2.put("1", 1);
		m2.put("3", 3);
		m2.put("2", 2);
		m2.put("5", 5);
		m2.put("4", 4);
		
		Iterator<Entry<String, Object>> i1 = m1.entrySet().iterator();
		Iterator<Entry<String, Object>> i2 = m2.entrySet().iterator();
		
		System.out.println("-----linkedhashmap-----");
		while(i1.hasNext()) {
			Entry<String, Object> entry = i1.next();
			System.out.println(entry.getKey() + ":" +entry.getValue());
		}
		System.out.println("-----TreeMap-----");
		while(i2.hasNext()) {
			Entry<String, Object> entry = i2.next();
			System.out.println(entry.getKey() + ":" +entry.getValue());
		}
		
	}
}

 

转载于:https://my.oschina.net/u/2308196/blog/3023114