使用排序Java查找坡度上的点

public class Point {
    private int x;
    private int y;

    public Point(int x, int y) {
        this.x = x;
        this.y = y;
    }

    public int getX() {
        return x;
    }

    public void setX(int x) {
        this.x = x;
    }

    public int getY() {
        return y;
    }

    public void setY(int y) {
        this.y = y;
    }
}

Point[] points = new Point[n]; // n为点的数量
Arrays.sort(points, Comparator.comparingInt(Point::getX));

List<Point> result = new ArrayList<>();
for (int i = 0; i < points.length - 1; i++) {
    if (points[i].getY() <= points[i + 1].getY()) {
        result.add(points[i]);
    }
}