算法60天：day58

单调栈-每日温度

力扣链接

class Solution {
public:
    vector<int> dailyTemperatures(vector<int>& temperatures) {
        stack<int> st;
        vector<int> result(temperatures.size() , 0);
        st.push(0);
        for(int i = 1; i < temperatures.size(); i++){
            if(temperatures[i] < temperatures[st.top()]){
                st.push(i);
            }else if(temperatures[i] == temperatures[st.top()]){
                st.push(i);
            }else{
                while(!st.empty() && temperatures[st.top()] < temperatures[i]){
                    result[st.top()] =  i - st.top();
                    st.pop();
                }
                st.push(i);
            }
        }
        return result;
    }
};

单调栈–下一个更大元素 I

力扣链接

class Solution {
public:
    vector<int> nextGreaterElement(vector<int>& nums1, vector<int>& nums2) {
        stack<int> st;
        st.push(0);

        vector<int> result(nums1.size() , -1);

        unordered_map<int,int> umap;    //key：元素 val：下标
        for(int i = 0; i < nums1.size(); i++){
            umap[nums1[i]] = i;
        }

        for(int i = 1; i < nums2.size(); i++){
            if(nums2[i] < nums2[st.top()]){
                st.push(i);
            }else if(nums2[i] == nums2[st.top()]){
                st.push(i);
            }else{
                while(!st.empty() && nums2[st.top()] < nums2[i]){
                    if(umap.count(nums2[st.top()])){
                        int index = umap[nums2[st.top()]];  //求出相应的下标
                        result[index] = nums2[i];
                    }
                    st.pop();
                }
                st.push(i);
            }
        }
        return result;
    }
};