Continue reading...
This is the same idea behind binary search. In a sorted array, you compare against the middle element and eliminate half the remaining candidates. In a quadtree, you choose one of four quadrants and ignore the other three regions. Each level narrows the search space by a factor of four instead of two.
，更多细节参见夫子
略好一点，没以前油了，风格化处理还是不太行，更多细节参见搜狗输入法2026
[&:first-child]:overflow-hidden [&:first-child]:max-h-full"，推荐阅读51吃瓜获取更多信息