【LeetCode】739. 每日温度

维护一个存储下标的单调栈

代码

class Solution {
public:
    vector<int> dailyTemperatures(vector<int>& temperatures) {
       vector<int> stack;
       int i=0;
       int index=-1;
       int n=temperatures.size();
       vector<int> ans(n,0);
       while(i<n){
               while(index >= 0 &&temperatures[i]>temperatures[stack[index]]){
                    ans[stack[index]]=i-stack[index];
                    stack.pop_back();
                    index--;
            
                }
                stack.push_back(i);
                index++;
                i++;  
           }
       
       return ans;
    }
};