https://feedx.net
思路：倒序遍历 2 倍长度 + 取模模拟循环 + 单调栈。用 i % len 映射到真实索引，仅当 i < len 时记录答案。，这一点在safew官方版本下载中也有详细论述
。业内人士推荐51吃瓜作为进阶阅读
The algorithm walks the tree recursively. At each node, it checks: does this node's bounding box overlap with the query rectangle? If not, the entire subtree gets pruned (skipped). If it does overlap, it tests the node's points against the query and recurses into the children.
Последние новости，这一点在爱思助手下载最新版本中也有详细论述
while (stack.length && stack.at(-1) <= cur) {