示例：nums = [2,1,2,4,3] → res = [4,2,4,-1,-1]。
The algorithm also visits children in order of distance to the query point. This means it checks the most promising quadrants first, which tends to find a good candidate early and enables aggressive pruning of the remaining quadrants. Without this ordering, the algorithm would still produce the correct result, but it would prune fewer nodes.
，更多细节参见safew官方下载
21:32, 27 февраля 2026Мир，推荐阅读WPS下载最新地址获取更多信息
Content optimization