【重点】【单调栈】739.每日温度

原创已于 2025-06-18 11:30:19 修改 · 515 阅读

8 ·

CC 4.0 BY-SA版权

文章标签：

#单调栈

于 2024-01-04 01:43:12 首次发布

labuladong的算法小抄笔记专栏收录该内容

83 篇文章

订阅专栏

题目

法1：典型单调栈

参考：本题答案
 灵茶山艾府讲解视频

Python

class Solution:
    def dailyTemperatures(self, temperatures: List[int]) -> List[int]:
        n = len(temperatures)
        res = [0] * n
        stack = []
        for i in range(n-1, -1, -1):
            while stack and temperatures[stack[-1]] <= temperatures[i]:
                stack.pop()
            if stack:
                res[i] = stack[-1] - i
            stack.append(i)

        return res

Java

class Solution {
    public int[] dailyTemperatures(int[] temperatures) {
        int n = temperatures.length;
        int[] res = new int[n];
        Stack<Integer> stack = new Stack<>();
        for (int i = n - 1; i >= 0; --i) {
            while (!stack.isEmpty() && temperatures[i] >= temperatures[stack.peek()]) {
                stack.pop();
            }
            res[i] = stack.isEmpty() ? 0 : stack.peek() - i;
            stack.push(i);
        }

        return res;
    }
}