java利用Comparator接口对自定义数组排序

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

public class MySort {

    public static void main(String[] args) {
        // TODO Auto-generated method stub

        Point[] parray = new Point[3];
        for(int i = 2;i >= 0;i --){
            parray[i] = new Point();
            parray[i].x = i;
            parray[i].y = i + 2;
        }
        
        Arrays.sort(parray,new PointComparator());
        
        for(int i = 0;i < 3;i ++){
            System.out.println("parray[i].x = " + parray[i].x + " "  + "parray[i].y =" + parray[i].y);
        }
    }

}

class Point{
   int x,y;
}


class PointComparator implements Comparator{

    @Override
    public int compare(Object o1, Object o2) {
        // TODO Auto-generated method stub
        Point p1 = (Point)o1;
        Point p2 = (Point)o2;
        
        if (p1.x != p2.x) 
            return p1.x > p2.x ? 1 : -1;   //升序
        else
            return p1.y > p2.y ? 1 : -1;
                
        
    }
    
}