Java 中 Comparator 与 Comparable区别

本文对比了Java中的Comparator与Comparable接口,讲解了它们在排序中的作用。Comparable用于对象的自然排序,而Comparator则提供更灵活的排序策略。示例展示了在Player类中如何实现这两个接口进行排序,以及Java8中Comparator的使用方式。总结了何时选择Comparator和Comparable的场景。
摘要由CSDN通过智能技术生成

简介

比较Comparator 与 Comparable接口。

示例

创建一个Player 类,并加入ArrayList

public class TestLearnJava {
    public static void main(String[] args) {
        List<Player> footballTeam = new ArrayList<>();
        Player player1 = new Player(59, "John", 20);
        Player player2 = new Player(67, "Roger", 22);
        Player player3 = new Player(45, "Steven", 24);
        footballTeam.add(player1);
        footballTeam.add(player2);
        footballTeam.add(player3);

        System.out.println("Before Sorting : " + footballTeam);
        Collections.sort(footballTeam);
        System.out.println("After Sorting : " + footballTeam);
    }
}

class Player {
    private int ranking;
    private String name;
    private int age;

    public Player(int ranking, String name, int age) {
        this.ranking = ranking;
        this.name = name;
        this.age = age;
    }

    public int getRanking() {
        return ranking;
    }

    public void setRanking(int ranking) {
        this.ranking = ranking;
    }

    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;
    }
}

输出

java: 对于sort(java.util.List<com.xx.learn.Player>), 找不到合适的方法
    方法 java.util.Collections.<T>sort(java.util.List<T>)不适用
      (推论变量 T 具有不兼容的上限
        等式约束条件:com.xx.learn.Player
        下限:java.lang.Comparable<? super T>)
    方法 java.util.Collections.<T>sort(java.util.List<T>,java.util.Comparator<? super T>)不适用
      (无法推断类型变量 T
        (实际参数列表和形式参数列表长度不同))

Comparable

正如命名所描述,Comparable是一个接口,定义一个策略用来比较相同的对象。这个被称为【自然排序】(natural ordering)。

所以,为了排序必须将类Player实现Comparable接口。

public class TestLearnJava {
    public static void main(String[] args) {
        List<Player> footballTeam = new ArrayList<>();
        Player player1 = new Player(59, "John", 20);
        Player player2 = new Player(67, "Roger", 22);
        Player player3 = new Player(45, "Steven", 24);
        footballTeam.add(player1);
        footballTeam.add(player2);
        footballTeam.add(player3);

        System.out.println("Before Sorting : " + footballTeam);
        Collections.sort(footballTeam);
        System.out.println("After Sorting : " + footballTeam);
    }
}

class Player implements Comparable<Player> {
    @Override
    public int compareTo(Player otherPlayer) {
        return Integer.compare(getRanking(), otherPlayer.getRanking());
    }

    private int ranking;
    private String name;
    private int age;

    public Player(int ranking, String name, int age) {
        this.ranking = ranking;
        this.name = name;
        this.age = age;
    }

    public int getRanking() {
        return ranking;
    }

    public void setRanking(int ranking) {
        this.ranking = ranking;
    }

    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;
    }
}

输出

Before Sorting : [com.xx.learn.Player@6d311334, com.xx.learn.Player@682a0b20, com.xx.learn.Player@3d075dc0]
After Sorting : [com.xx.learn.Player@3d075dc0, com.xx.learn.Player@6d311334, com.xx.learn.Player@682a0b20]

Comparator

Comparator接口定义了一个compare(arg1, arg2)方法。

示例

public class TestLearnJava {
    public static void main(String[] args) {
        List<Player> footballTeam = new ArrayList<>();
        Player player1 = new Player(59, "John", 20);
        Player player2 = new Player(67, "Roger", 22);
        Player player3 = new Player(45, "Steven", 24);
        footballTeam.add(player1);
        footballTeam.add(player2);
        footballTeam.add(player3);

        System.out.println("Before Sorting : " + footballTeam);
        PlayerRankingComparator playerComparator = new PlayerRankingComparator();
        Collections.sort(footballTeam, playerComparator);
        System.out.println("After Sorting : " + footballTeam);
    }
class PlayerRankingComparator implements Comparator<Player> {

    @Override
    public int compare(Player firstPlayer, Player secondPlayer) {
        return Integer.compare(firstPlayer.getRanking(), secondPlayer.getRanking());
    }
}

class PlayerAgeComparator implements Comparator<Player> {
    @Override
    public int compare(Player firstPlayer, Player secondPlayer) {
        return Integer.compare(firstPlayer.getAge(), secondPlayer.getAge());
    }
}

输出

Before Sorting : [com.xx.learn.Player@6d311334, com.xx.learn.Player@682a0b20, com.xx.learn.Player@3d075dc0]
After Sorting : [com.xx.learn.Player@3d075dc0, com.xx.learn.Player@6d311334, com.xx.learn.Player@682a0b20]

Java 8 Comparator使用方式

Comparator<Player> byRanking = Comparator
                .comparing(Player::getRanking);

Comparator vs Comparable比较

当不能修改类的源代码时,又需要排序,则使用Comparator,否则使用comparable

当需要不同的比较策略时,可以使用Comparator

参考链接:https://www.baeldung.com/java-comparator-comparable

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
JavaComparatorComparable都是用于对象排序的接口,它们的区别在于: 1. Comparable是在对象内部实现的接口,实现了Comparable接口的类可以通过实现compareTo()方法来指定对象之间的自然排序规则。例如,如果一个类实现了Comparable接口,那么它的对象可以直接通过Collections.sort()或Arrays.sort()方法进行排序。 2. Comparator是在对象外部实现的接口,它可以用于对不支持自然排序的类进行排序。Comparator接口定义了一个compare()方法,用于比较两个对象的大小关系。在排序时,可以通过传入一个Comparator对象来指定排序规则。 举个例子,假设我们有一个Circle类,它有radius属性,我们可以通过实现Comparable接口来指定Circle对象之间的自然排序规则,如下所示: ```java public class Circle implements Comparable<Circle> { private double radius; public Circle(double radius) { this.radius = radius; } public double getRadius() { return radius; } @Override public int compareTo(Circle o) { if (this.radius < o.radius) { return -1; } else if (this.radius > o.radius) { return 1; } else { return 0; } } } ``` 在上面的例子,我们通过实现Comparable接口来指定Circle对象之间的自然排序规则,即按照半径从小到大排序。现在我们可以直接使用Collections.sort()方法对Circle对象进行排序,如下所示: ```java List<Circle> circles = new ArrayList<>(); circles.add(new Circle(3)); circles.add(new Circle(1)); circles.add(new Circle(2)); Collections.sort(circles); System.out.println(circles); // 输出:[Circle(radius=1.0), Circle(radius=2.0), Circle(radius=3.0)] ``` 如果我们想要按照半径从大到小排序,可以通过实现Comparator接口来指定排序规则,如下所示: ```java public class CircleComparator implements Comparator<Circle> { @Override public int compare(Circle o1, Circle o2) { if (o1.getRadius() < o2.getRadius()) { return 1; } else if (o1.getRadius() > o2.getRadius()) { return -1; } else { return 0; } } } ``` 在上面的例子,我们通过实现Comparator接口来指定Circle对象之间的排序规则,即按照半径从大到小排序。现在我们可以通过传入一个CircleComparator对象来对Circle对象进行排序,如下所示: ```java List<Circle> circles = new ArrayList<>(); circles.add(new Circle(3)); circles.add(new Circle(1)); circles.add(new Circle(2)); Collections.sort(circles, new CircleComparator()); System.out.println(circles); // 输出:[Circle(radius=3.0), Circle(radius=2.0), Circle(radius=1.0)] ```
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值