java中Collections的sort排序

这里用源码给大家讲述java中Collections的排序

1：这是一个普通的javaBean

public class SortBean {


private int num;

private String name;


public SortBean(){}

public SortBean(int num,String name){
this.name = name;
this.num = num;
}

public int getNum() {
return num;
}


public void setNum(int num) {
this.num = num;
}


public String getName() {
return name;
}


public void setName(String name) {
this.name = name;
}


}

2：开始测试Collections的排序方法

package sort;


import java.util.ArrayList;
import java.util.Collections;
import java.util.Comparator;
import java.util.List;


/*****
 * @describe 使用Collections对象的sort排序
 *
 * @author huan
 *
 * 2013-11-1
 *
 ***/
public class SortTest {


public static void main(String[] args) {
SortBean sortBean1 = new SortBean(1,"张三");
SortBean sortBean2 = new SortBean(3,"王五");
SortBean sortBean3 = new SortBean(2,"李四");
SortBean sortBean4 = new SortBean(4,"赵六");
SortBean sortBean5 = new SortBean(6,"王八");
SortBean sortBean6 = new SortBean(5,"贾七");

List<SortBean> beans = new ArrayList<SortBean>();
beans.add(sortBean1);
beans.add(sortBean2);
beans.add(sortBean3);
beans.add(sortBean4);
beans.add(sortBean5);
beans.add(sortBean6);

Collections.sort(beans, new Comparator<SortBean>() {


public int compare(SortBean o1, SortBean o2) {
//顺序
return o1.getNum() - o2.getNum();
}

});

Collections.sort(beans, new Comparator<SortBean>() {


public int compare(SortBean o1, SortBean o2) {
//倒叙
return o2.getNum() - o1.getNum();
}
});

for (int i = 0; i < beans.size(); i++) {
System.out.println(beans.get(i).getNum()+" "+beans.get(i).getName());
}
 
}
}

大家可以拿过去试试，这个例子是特简单的。嘻嘻~~~