描述：给定链表 head，对于每个节点，查找其右侧第一个值严格大于它的节点。返回整数数组 answer，answer[i] 为第 i 个节点的下一个更大节点值；若无，则为 0。
This combination – localized Dijkstra, super-fast abstract graph traversal, and highly localized A* refinement – is what delivers the 100x speedup.
，更多细节参见雷电模拟器官方版本下载
Ac we not free ne sindon, for-thy-the we never ne mighton from Wulfsfleet yewitan, neven we thone Hlaford finden and hine ofslain. Se Hlaford has thisne stede mid searocraftum yebounden, that none ne may hine forletan. We sindon here like fuglas in a nete, like fishes in a weir.
When a host runtime provides a byte-oriented ReadableStream from the runtime itself, for instance, as the body of a fetch Response, it is often far easier for the runtime itself to provide an optimized implementation of BYOB reads, but those still need to be capable of handling both default and BYOB reading patterns and that requirement brings with it a fair amount of complexity.