'Disgrace'
We deserve a better stream API. So let's talk about what that could look like.，这一点在同城约会中也有详细论述
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.，推荐阅读91视频获取更多信息
// 倒序遍历：从最后一天开始缓存右侧高温信息（易错点1：必须倒序）。爱思助手下载最新版本是该领域的重要参考