739. Daily Temperatures**

最新推荐文章于 2024-11-04 12:20:00 发布

珍妮的选择

最新推荐文章于 2024-11-04 12:20:00 发布

阅读量298

点赞数

分类专栏： LeetCode 文章标签： leetcode 算法

本文链接：https://blog.csdn.net/Eric_1993/article/details/105214170

版权

LeetCode 专栏收录该内容

416 篇文章 4 订阅

订阅专栏

739. Daily Temperatures**

https://leetcode.com/problems/daily-temperatures/

题目描述

Given a list of daily temperatures T, return a list such 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 of temperatures T = [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].

C++ 实现 1

其实这道题就是求 Next Great Number, 比如该思路还可以处理 496. Next Greater Element I* 以及 1019. Next Greater Node In Linked List**. 维护一个单调栈, 从栈顶到栈底元素是递增的(实际上栈中保存的是元素的索引值).

class Solution {
public:
    vector<int> dailyTemperatures(vector<int>& T) {
        vector<int> res(T.size(), 0);
        stack<int> st;
        for (int i = 0; i < T.size(); ++ i) {
            while (!st.empty() && T[i] > T[st.top()]) {
                auto idx = st.top();
                st.pop();
                res[idx] = i - idx;
            }
            st.push(i);
        }
        return res;
    }
};