代码随想录算法训练营第六十天 |84. 柱状图中最大的矩形

84. 柱状图中最大的矩形

题目

解法

题解链接

1. 双指针

class Solution {
public:
    int largestRectangleArea(vector<int>& heights) {
        
        vector<int> mixLeftId(heights.size());
        vector<int> mixRightId(heights.size());
        int size = heights.size();
        // 左边
        mixLeftId[0] = -1;
        for(int i = 1; i < size; i++){
            int t = i-1;
            while(t >= 0 && heights[t] >= heights[i]){
                t = mixLeftId[t];
            }
            mixLeftId[i] = t;
        }
        // 右边
        mixRightId[size-1] = size;
        for(int i = size-2; i >=0; i--){
            int t = i+1;
            while(t < size && heights[t] >= heights[i]){
                t = mixRightId[t];
            }
            mixRightId[i] = t;
        }
        // 求和
        int result = 0;
        for(int i = 0; i < size; i++){
            int sum = heights[i] * (mixRightId[i] - mixLeftId[i] - 1 );
            result = max(sum, result);
        }
        return result;
    }
};

时间复杂度：O( n)
空间复杂度：O(n )
2.单调栈

class Solution {
public:
    int largestRectangleArea(vector<int>& heights) {
        
        heights.insert(heights.begin(), 0);
        heights.push_back(0);
        stack<int> st;
        st.push(0);
        int sum = 0;
        for(int i = 1; i < heights.size(); i++){
            if(heights[i] > heights[st.top()]){
                st.push(i);
            }else if(heights[i] == heights[st.top()]){
                st.pop();
                st.push(i);
            }else{
                while(!st.empty() && heights[i] < heights[st.top()]){
                    int mid = st.top();//峰值
                    st.pop();
                    if(!st.empty()){
                        int h = heights[mid];
                        int w = i - st.top() - 1;
                        sum = max(h*w, sum);
                        
                    }
                }
                st.push(i);
            }
        }
        return sum;
    }
};

时间复杂度：O( n)
空间复杂度：O(n )

感悟

重在逻辑思考