First, the data structure. We will be using a mutually recursive pair of a tree, which holds a value, and a forest, which holds a linked list of trees:
* @returns {number[]} 每个位置需等待的天数（无更高温则为0），详情可参考新收录的资料
23 %v0:Int = 20。新收录的资料是该领域的重要参考
Credit: Samsung。关于这个话题，新收录的资料提供了深入分析