[LeetCode] 739. Daily Temperatures

轉自LeetCode

Given a list of daily temperatures, produce a list that, for each day in the input, tells you how many days you would have to wait until a warmer temperature. If there is no future day for which 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].

<Solution>

這題和 496. Next Greater Number 的解題想法其實一樣

對每個數，找出在它右邊第一個大於它的數，然後 stack 存的改成 index

然後這題最後的答案，就是計算出那個數離自己有多遠即可

code如下

C++

Java

kotlin