binary search

編程作業: Kd-Trees 100分關鍵在如果當前最短距離>區域到點最短距離時才找，區域到點的最短距離可先用點到線的距離比過 PointSET.java import java.util.LinkedList; import java.util.List; import java.util.TreeSet; import edu.princeton.cs.algs4.Point2D; import edu.princeton.cs.algs4.RectHV; public class PointSET { private TreeSet<Point2D> set; public PointSET() { this.set = new TreeSet<>(); } public boolean isEmpty() { return this.set.isEmpty(); } public int size() { return this.set.size(); } public void insert(Point2D p) { requireNonNull(p); this.set.add(p); } public boolean contains(Point2D p) { requireNonNull(p); return this.set.contains(p); } public void draw() { for (Point2D p : this.set) p.