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 len=T.size();
        vector<int> ret(len, 0);
        stack<int> s;
        for(int i=0;i<len;i++){
            // 递减栈 不满足条件就出栈 一边出栈一边填写值
            while(!s.empty() && T[s.top()]<T[i]){
                int tmp=s.top();s.pop();// 比栈顶元素大的值就是当前元素
                ret[tmp] = i-tmp;
            }
            s.push(i);
        }
        return ret;
    }
};