Java中sort函数的用法

自定义排序规则

代码一

import java.util.*;
class Num
{
    int x;
}
class Cmp implements Comparator<Num>
{
    public int compare(Num a,Num b)  //不能是静态的
    {
        if(a.x > b.x) return 1;   //按升序排
        else if(a.x == b.x)   return 0;
        else return -1;
    }
}
class Main
{
    public static void main(String[] args)
    {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        Num s[] = new Num[n];
        for(int i=0;i<n;i++)
        {
           s[i]=new Num();  //这句容易忘记
           s[i].x=sc.nextInt();
        }
        Arrays.sort(s,0,n,new Cmp());
        for(int i=0;i<n;i++)    System.out.print(s[i].x+" "); 
    }
}

代码二

import java.util.*;
public class Main
{
    public static class Num implements Comparable<Num>
    {
        int x;
        public Num(int x)
        {
            this.x=x;
        }
        
        public int compareTo(Num p)
        {
            return this.x-p.x;
        }
    }
    public static void main(String[] args)
    {
        Scanner sc = new Scanner(System.in);
        int n=sc.nextInt();
        Num[] a = new Num[n];
        for(int i=0;i<n;i++)
            a[i]=new Num(sc.nextInt());
        Arrays.sort(a);
        
        for(int i=0;i<n;i++)
            System.out.print(a[i].x+" ");
    }
}

默认升序

import java.util.*;
class Main
{
    public static void main(String[] args)
    {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int s[] = new int[n];
        for(int i=0;i<n;i++)
        {
           s[i]=sc.nextInt();
        }
        Arrays.sort(s,0,n);
        for(int i=0;i<n;i++)    System.out.print(s[i]+" "); 
    }
}