JAVA小练习119——treeMap

import java.util.TreeMap;
import java.util.Comparator;
class Emp /* implements Comparable<Emp> */ {
	String name;
	int salary;
	
	public Emp(String name, int salary) {
		super();
		this.name = name;
		this.salary = salary;
	}

	@Override
	public String toString() {
		return "{姓名：" +this. name + "薪水：" + this.salary + "}";
	}
}

	
	/*public int compareTo(Emp o) {
		
		return this.salary-o.salary;
	}*/
	
	//自定义一个比较器
	class AgeComparator implements Comparator<Emp>{
		public int compare(Emp o1,Emp o2) {
			return o1.salary-o2.salary;
		}
		
	}
			



public class Demo119 {

	public static void main(String[] args) {
		AgeComparator comparator=new AgeComparator();
		TreeMap<Emp,String> tree=new TreeMap<Emp,String>( comparator);
		tree.put(new Emp("老大",2500),"001");
		tree.put(new Emp("老二",3500),"002");
		tree.put(new Emp("老三",9500),"003");
		tree.put(new Emp("老四",6500),"002");
		tree.put(new Emp("老王",2500),"009");//返回值为0，重复元素，舍弃。但是相同键的值会取代原来的值，即001---009
		
		System.out.println("集合元素："+tree);
	}

}