Day50 单调栈

739. 每日温度

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 {
                while(!st.empty() && temperatures[i] > temperatures[st.top()]) {
                    result[st.top()] = i - st.top();
                    st.pop();
                }
                st.push(i);
            }
        }
        return result;
    }
};

496. 下一个更大元素 I

class Solution {
public:
    vector<int> nextGreaterElement(vector<int>& nums1, vector<int>& nums2) {
        vector<int> ret(nums1.size(), -1);
        if (nums1.size() == 0) return ret;

        unordered_map<int, int> umap; // key = nums1.value, value = nums1.index
        for (int i = 0; i < nums1.size(); i++) {
            umap[nums1[i]] = i;
        }

        stack<int> s;
        s.push(nums2[0]);
        
        for (int i = 1; i < nums2.size(); i++) {
            if (nums2[i] > s.top()) {
                while(!s.empty() && nums2[i] > s.top() && umap.count(s.top()) > 0) {
                    ret[umap[s.top()]] = nums2[i];
                    s.pop();
                }
            }
            s.push(nums2[i]);
        }

        return ret;
    }
};