java Arrays排序

public class Main {
static ArrayList<Integer> list;

public static void main(String[] args) {
// TODO Auto-generated method stub
//原始类型数组的排序
int[] a = new int[] { 1, 5, 3 };
for (int value : a) {
System.out.println(value);
}
Arrays.sort(a);
for (int value : a) {
System.out.println(value);
}
//引用类型数组的排序
People[] peoples=new People[]{new People("zhang",20),new People("li",25),new People("wang",15),new People("qian",15)};
for(People p:peoples){
System.out.println(p);
}
Arrays.sort(peoples);
for(People p:peoples){
System.out.println(p);
}
}

}

class People implements Comparable {
//必须实现Comparable接口
String name;
int age;

People(String name, int age) {
this.name = name;
this.age = age;
}

@Override
public int compareTo(Object o) {
//重写Comparable接口的compareTo方法
//先根据age排序,如果age相同,再根据name排序
People p = (People) o;
int result;
if (age > p.age) {
result = 1;
} else if (age == p.age) {
result=0;
} else {
result = -1;
}
if(result==0){
result=name.compareTo(p.name);
}
return result;
}

@Override
public String toString() {
// TODO Auto-generated method stub
return "Name:"+name+" Age:"+age;
}

}
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值