ArraySortDemo1

package ArraySort;
import java.util.Arrays;
public class ArraySortDemo1
{
public static void main(String[] args)
{
Dog o1 = new Dog("dog1", 1);
Dog o2 = new Dog("dog2", 4);
Dog o3 = new Dog("dog3", 5);
Dog o4 = new Dog("dog4", 2);
Dog o5 = new Dog("dog5", 3);
Dog[] dogs = new Dog[] { o1, o2, o3, o4, o5 };
System.out.println("排序前");
for (Dog d:dogs) {
System.out.println(d.getName());
}
System.out.println("排序后");
Arrays.sort(dogs);
for (Dog d:dogs) {
System.out.println(d.getName());
}
}
}
class Dog implements Comparable{
private String name;
private int weight;

public Dog(String name, int weight) {
this.setName(name);
this.weight = weight;
}

public int getWeight() {
return weight;
}

public void setWeight(int weight) {
this.weight = weight;
}

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

public String getName() {
return name;
}
public int compareTo(Object o)
{
Dog d=(Dog)o;
if(this.getWeight()>d.getWeight())
return 1;
else if(this.getWeight()<d.getWeight())
return -1;
else
return 0;
}
}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值