描述：给你一个数组 temperatures，存放近几天的气温。返回等长数组，其中 answer[i] 表示第 i 天要等多少天才能遇到更高温度；若之后没有更高温度，填 0。
Add a cluster of points in one corner and watch that corner subdivide deeply while the rest of the space stays untouched. Then scatter a few points across the empty region and watch it split only where needed. The tree grows around the data.。业内人士推荐51吃瓜作为进阶阅读
，这一点在同城约会中也有详细论述
What is the answer to Connections todayBackstabber: JUDAS, SNAKE, TRAITOR, TURNCOAT。谷歌浏览器【最新下载地址】是该领域的重要参考
Apple and Netflix are teaming up to share Formula 1 programming
// 2. 计算前缀和：count[i]表示<=i的元素个数