java中Arrays中sort的两种用法

java sort的两种实现方法

import java.util.Arrays;
import java.util.Comparator;
import java.util.Scanner;

class Juxing implements Comparable{
    private int a,b;

    public Juxing(int a, int b) {
        this.a = a;
        this.b = b;
    }

    public int getAreas(){
        return a * b;
    }

    public int getA() {
        return a;
    }

    public void setA(int a) {
        this.a = a;
    }

    public int getB() {
        return b;
    }

    public void setB(int b) {
        this.b = b;
    }

    //
    @Override
    public int compareTo(Object o) {
        return ((Juxing)o).getAreas() - this.getAreas();
    }

    @Override
    public String toString(){
        return " " + getA() + ": " + getB() + "; " + getAreas();
    }
}

public class Main {
    public static void main(String[] args) {
       Juxing[] jx = new Juxing[6];

       Scanner cin = new Scanner(System.in);

       for (int i = 0; i < 6; i ++){
           jx[i] = new Juxing(cin.nextInt(), cin.nextInt());
       }

        //
//        Arrays.sort(jx, new Comparator<Juxing>() {
//            @Override
//            public int compare(Juxing o1, Juxing o2) {
//                return (int)(o2.getAreas() - o1.getAreas());
//            }
//        });

        Arrays.sort(jx);

       for(Juxing j:jx){
           System.out.println(j);
       }
       cin.close();
    }
}