java的set升序显示_如何把Set集合的数据进行强行逆转排序

import java.util.Collections;

import java.util.Comparator;

import java.util.Iterator;

import java.util.Set;

import java.util.TreeSet;

public class ComparableTest {

/**

* @param args

*/

public static void main(String[] args) {

// TODO Auto-generated method stub

Set s=new TreeSet(Collections.reverseOrder());

s.add(new Stu("liumeng",11));

s.add(new Stu("asd",134));

s.add(new Stu("asf",34));

Iterator iterator=s.iterator();

while(iterator.hasNext())

{

Stu ss=iterator.next();

System.out.println(ss.getName());

}

}

}

class Stu implements Comparable

{

public String getName() {

return name;

}

public void setName(String name) {

this.name = name;

}

public int getAge() {

return age;

}

public void setAge(int age) {

this.age = age;

}

private String name;

public Stu(String name, int age) {

super();

this.name = name;

this.age = age;

}

private int age;

@Override

public int compareTo(Stu o) {

int num=this.name.compareTo(o.name);

if(num==0)

return this.age-o.age;

return num;

}

}