Sam PirantyBBC Eye Investigations
工具的选择也很重要，但不应该让工具主导流程。
，更多细节参见91视频
const res = new Array(n).fill(0);
The algorithm maintains a running "best distance" that starts at infinity. As it walks the tree, it checks each visited point and updates the best distance if it finds something closer. Before recursing into a child node, it checks whether the closest possible point in that child's bounding box is farther than the current best. If so, the entire subtree gets pruned.