public class user {
private int age;
private int index;
public user(int _age, int _index){
this.age=_age;
this.index=_index;
}
public int getAge() {
return age;
}
public void setAge(int age) {
this.age = age;
}
public int getIndex() {
return index;
}
public void setIndex(int index) {
this.index = index;
}
}
import java.util.ArrayList;
import java.util.Collections;
import java.util.Comparator;
public class main {
public static void main(String[] args) {
ArrayList<user> list=new ArrayList<user>();
list.add(new user(10,94));
list.add(new user(1,99));
list.add(new user(2,99));
list.add(new user(3,99));
list.add(new user(14,99));
list.add(new user(45,99));
list.add(new user(76,99));
list.add(new user(23,33));
list.add(new user(776,99));
list.add(new user(23,99));
list.add(new user(44,99));
list.add(new user(33,99));
list.add(new user(22,99));
list.add(new user(112,1));
list.add(new user(34,99));
Collections.sort(list, new Comparator<user>(){
@Override
public int compare(user o1, user o2) {
int max=o1.getIndex()-o2.getIndex();
if(max!=0){
return max;
}
return 1;
}
});
for(user u:list){
System.out.println(u.getAge());
}
}
}
这种排序方式是根据 user.getIndex() 排序的 最小的排在最前面