### LeetCode题目

Given a list of daily temperatures,produce a list that, for each day in the input, tells you how many days youwould have to wait until a warmer temperature. If there is no future day forwhich this is possible, put 0 instead.

For example, given the list temperatures = [73, 74, 75, 71, 69, 72, 76,73], your output should be [1, 1, 4, 2, 1, 1, 0, 0].

Note: The length of temperatures will be in the range [1, 30000].Each temperature will be an integer in the range [30, 100].

• 考查知识点：栈，数组的遍历
• 情形一：当天的T高于第二天，暂时无法确定最邻近的天数，则将当天温度入栈。
• 情形二：当天的T低于第二天，则等待的天数为1。但此时须更新栈顶元素的等待天数。

### 运行情况

-------------本文结束感谢您的阅读-------------
0%