LeetCode #739 - 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].

class Solution {
public:
    vector<int> dailyTemperatures(vector<int>& T) {
        int n=T.size();
        vector<int> result(n,0);
        //构造一个从栈顶到栈底递增的栈，即保证栈顶是栈中最小的元素
        stack<int> s; //每次遍历到一个元素，需要用它去更新栈中比它小的元素，自然需要把最小值放在栈顶
        for(int i=0;i<n;i++)
        {
            if(s.empty()) s.push(i);
            else
            {
                if(T[s.top()]>=T[i]) s.push(i);
                else
                {
                    while(!s.empty()&&T[s.top()]<T[i])
                    {
                        int t=s.top();
                        result[t]=i-t;
                        s.pop();
                    }
                    s.push(i);
                }
            }
        }
        return result;
    }
};