JAVA排序类问题

package simple;

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

import org.junit.Test;
//这里HashMap内部不会排序，TreeMap内会排序，这也是这两个MAP的区别，通常用HashMap这样处理效率更高。用到排序时候TreeMap
class TreeMapDemo{
	@SuppressWarnings("unused")
	public void treeMapDemo(int array[]){
		Map<Integer, Integer> maps = new TreeMap<Integer, Integer> ();
		for(int i : array){
			if(maps.get(i)==null){
				maps.put(i, 1);
			}
			else{
				maps.put(i, maps.get(i)+1);
			}
		}
		Iterator<Integer> it = maps.keySet().iterator();
		while(it.hasNext()){
			int key = it.next();
			System.out.print(key+"个数是:"+maps.get(key)+",");
		}
	}
}

class HashMapDemo{
	@SuppressWarnings("unused")
	public void treeMapDemo(int array[]){
		Map<Integer, Integer> maps = new HashMap<Integer, Integer> ();
		for(int i : array){
			if(maps.get(i)==null){
				maps.put(i, 1);
			}
			else{
				maps.put(i, maps.get(i)+1);
			}
		}
		Iterator<Integer> it = maps.keySet().iterator();
		while(it.hasNext()){
			int key = it.next();
			System.out.print(key+"个数是:"+maps.get(key)+",");
		}
	}
}


public class mapDemo {
    int array[] = { 2, 5, 6, 2, 4, 3, 5, 4, 2, 5, 2, 4, 2, 6, 3, 5, 4, 2,
    		3, 5, 6, 5, 2, 4, 2, 5, 2, 3, 5, 2, 3, 5, 2, 3, 5, 2, 3, 5, 2,
    		7, 8, 8, 7, 8, 7, 9, 0 }; 
	//@Test
	public void DemoTreeTest(){
		TreeMapDemo treeMap = new TreeMapDemo();
		treeMap.treeMapDemo(array);
	}

	@Test
	public void DemoHsahTest(){
		HashMapDemo HashMap = new HashMapDemo();
		HashMap.treeMapDemo(array);
	}
	
}

 

转载于:https://www.cnblogs.com/ppgs8903/archive/2012/12/12/4343284.html