[LeetCode题解] 739. 每日温度

题目链接: https://leetcode-cn.com/problems/longest-substring-without-repeating-characters/submissions/.
该题的基本思路是维护一个单调栈。

Python source code:
class Solution:
    def dailyTemperatures(self, T: List[int]) -> List[int]:
        stack = []
        res = [0] * len(T)
        for k, v in enumerate(T):
            if stack:
                while stack and v > T[stack[-1]]:
                    res[stack[-1]] = k - stack[-1]
                    stack.pop()
            stack.append(k)
        return res
Java source code:
class Solution {
    public int[] dailyTemperatures(int[] T) {
        Stack<Integer> tmp = new Stack<>();
        int[] res = new int[T.length];

        for(int i = 0; i < T.length; i++) {
            if (tmp.size() > 0) {
                while ((tmp.size() > 0) && (T[i] > T[tmp.peek()])) {
                    res[tmp.peek()] = i - tmp.peek();
                    tmp.pop();
                }
            }
            tmp.push(i);
        }
        return res;
    }
}

以input = [73, 74, 75, 71, 69, 72, 76, 73]为例子，解释stack内的变化：
i = 0：[0] 此时代表73的index入栈
i = 1：[1] 此时比较74与栈顶元素的大小，当发现74大于73，这个时候73所代表的值 = 74的index - 73的index。栈pop栈顶（因为栈顶已经找到了比它大的元素）
i = 2：[2]
i = 3：[2, 3]
i = 4：[2, 3, 4]
i = 5：[2, 5] 此时72在while循环中与栈顶元素69, 71进行比较
i = 6：[6] 此时76在while循环中与栈顶元素72, 75进行比较
i = 7：[6, 7]