在TreeSet中实现存储自定义对象，并且能够按照特定的顺序排序

package cn.itcast.demo;

import java.util.*;
class Person implements Comparable
{
	private String name;
	private int age;
	private int score;
	
	Person(String name,int age,int score)
	{
		this.name=name;
		this.age=age;
		this.score=score;
	}
	public int getAge()
	{
		return age;
	}
	public String getName()
	{
		return name;
	}
	public int getScore()
	{
		return score;
	}
	public int compareTo(Object obj)
	{
		if (!(obj instanceof Person))
		{
			throw new RuntimeException("吊爆了！");
		}
		Person p=(Person)obj;
		if (this.age>p.age)
		{
			return 1;
		}
		if (this.age==p.age)
		{
			return this.name.compareTo(p.name);
		}
		return -1;
	}
}
class TreeSetTest1
{
	public static void main(String[] args)
	{
		//TreeSet t=new TreeSet(new Mycompare()); //按照姓名
		//TreeSet t=new TreeSet(new Mycompare1()); //按照年龄
		TreeSet t=new TreeSet(new Mycompare2()); //按照分数
		
		t.add(new Person("xxc1",15,99));
		t.add(new Person("xxc2",20,98));
		t.add(new Person("xxc6",17,108));
		t.add(new Person("xxc3",16,77));
		t.add(new Person("xxc5",10,230));
		Iterator t1=t.iterator();
		while (t1.hasNext())
		{
			Person p=(Person)t1.next();
			System.out.println(p.getName()+"======"+p.getAge()+"======"+p.getScore());
		}
	}
}
class Mycompare1 implements Comparator
{
	public int compare(Object o1,Object o2)
	{
		Person p=(Person)o1;
		Person p1=(Person)o2;
		//int num=p.getAge().compareTo(p1.getAge());
		int num = p.getAge() -p1.getAge();
		if (num==0)
		{
			return new Integer (p.getAge()).compareTo(new Integer(p1.getAge()));
		}
		return num;
	}
}

class Mycompare implements Comparator
{
	public int compare(Object o1,Object o2)
	{
		Person p=(Person)o1;
		Person p1=(Person)o2;
		int num=p.getName().compareTo(p1.getName());
		if (num==0)
		{
			return new Integer (p.getAge()).compareTo(new Integer(p1.getAge()));
		}
		return num;
		
	}
}

class Mycompare2 implements Comparator
{
	public int compare(Object o1,Object o2)
	{
		Person p=(Person)o1;
		Person p1=(Person)o2;
		//int num=p.getAge().compareTo(p1.getAge());
		int num = p.getScore() -p1.getScore();
		if (num==0)
		{
			return new Integer (p.getAge()).compareTo(new Integer(p1.getAge()));
		}
		return num;
	}
}