LinkedHashMap和TreeMap

1.LinkedHashMap可以put的先后顺进行有序存储

	public static void main(String[] args) {
		LinkedHashMap<Integer, String> map=new LinkedHashMap<Integer,String>();
		map.put(4, "four");
		map.put(2, "two");
		map.put(5, "five");
		map.put(1, "one");
		map.put(3, "three");
		
		
		Set<Integer> set=new HashSet<Integer>();
		set=map.keySet();
		Iterator<Integer> iterator=set.iterator();
		
		while(iterator.hasNext()){
			int i=iterator.next();
			String s=map.get(i);
			System.out.println(s);
		}
		//打印结果如下：
		//four
		//two
		//five
		//one
		//three
	}

2.TreeMap可以按key的排序进行有序存储

	public static void main(String[] args) {
		TreeMap<Integer, String> map=new TreeMap<Integer,String>();
		map.put(4, "four");
		map.put(2, "two");
		map.put(5, "five");
		map.put(1, "one");
		map.put(3, "three");
		
		
		Set<Integer> set=new HashSet<Integer>();
		set=map.keySet();
		Iterator<Integer> iterator=set.iterator();
		
		while(iterator.hasNext()){
			int i=iterator.next();
			String s=map.get(i);
			System.out.println(s);
		}
		//打印结果如下：
		//one
		//two
		//three
		//four
		//five
	}