finish (#212)

finish (#212)

Author: codingories

src/main/java/com/github/hcsp/polymorphism/Point.java

@@ -2,12 +2,15 @@
 
 import java.io.IOException;
 import java.util.Arrays;
+import java.util.Collection;
+import java.util.Collections;
 import java.util.List;
 
-public class Point {
+public class Point implements Comparable<Point> {
 
     private final int x;
     private final int y;
+
     // 代表笛卡尔坐标系中的一个点
     public Point(int x, int y) {
         this.x = x;
@@ -53,7 +56,10 @@ public String toString() {
 
     // 按照先x再y，从小到大的顺序排序
     // 例如排序后的结果应该是 (-1, 1) (1, -1) (2, -1) (2, 0) (2, 1)
-    public static List<Point> sort(List<Point> points) {}
+    public static List<Point> sort(List<Point> points) {
+        Collections.sort(points);
+        return points;
+    }
 
     public static void main(String[] args) throws IOException {
         List<Point> points =
@@ -65,4 +71,20 @@ public static void main(String[] args) throws IOException {
                         new Point(2, -1));
         System.out.println(Point.sort(points));
     }
+
+    @Override
+    public int compareTo(Point that) {
+        if (this.x < that.x) {
+            return -1;
+        } else if (this.x > that.x) {
+            return 1;
+        }
+
+        if (this.y < that.y) {
+            return -1;
+        } else if (this.y > that.y) {
+            return 1;
+        }
+        return 0;
+    }
 }