java,sort的數組降序

1.Array.sort(數組，起始位置，結束位置)。這個是升序排序。

2.關於數組的降序實現如下：

　　利用Collections.reverseOrder()方法：

import java.util.Arrays;
import java.util.Collections;
 
public class Main
{
    public static void main(String[] args) 
    {
        int[] a = {9, 8, 7, 2, 3, 4, 1, 0, 6, 5};
        Arrays.sort(a,Collections.reverseOrder());
    }
}

　　實現Comparator接口的復寫compare()方法:

代碼實現如下：

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

class Cmp1 implements Comparator<Integer>
{
    public int compare(Integer o1, Integer o2) 
    {
        if(o1 < o2)
        {
            return 1;
        }
        else if(o1 == o2)
        {
            return 0;
        }
        else
        {
            return -1;
        }
    }
    
}
public class Main
{
    static final int MAX = 105;
    static Integer goods[] = new Integer[MAX];
    public static void main(String[] args)
    {
        Scanner cin = new Scanner(System.in);
        while(cin.hasNext())
        {
            int N = cin.nextInt();
            int c1 = cin.nextInt();
            int c2 = cin.nextInt();
            for(int i = 0; i < N; i++)
            {
                goods[i] = cin.nextInt();
            }
            Arrays.sort(goods,0,N,new Cmp1());
            for(int i = 0; i < N; i++)
            {
                System.out.println(goods[i]);
            }
        }
    }
}