leetcode（力扣）84. 柱状图中最大的矩形

最新推荐文章于 2024-07-14 11:23:58 发布

大鹏good

最新推荐文章于 2024-07-14 11:23:58 发布

阅读量535

点赞数

文章标签： leetcode 算法职场和发展

本文链接：https://blog.csdn.net/dapeng908972264/article/details/127939511

版权

84. 柱状图中最大的矩形

动态规划做法：

class Solution {
public:
    int largestRectangleArea(vector<int>& heights) {

    vector<int> minLeftIndex(heights.size());
        vector<int> minRightIndex(heights.size());
        int size = heights.size();

        // 左边小于该柱子
        minLeftIndex[0] = -1; 
        for (int i = 1; i < size; i++) {
            int t = i - 1;
            
            while (t >= 0 && heights[t] >= heights[i]) t = minLeftIndex[t];
            minLeftIndex[i] = t;
        }
        //  右边小于该柱子的下标
        minRightIndex[size - 1] = size; 
        for (int i = size - 2; i >= 0; i--) {
            int t = i + 1;
           
            while (t < size && heights[t] >= heights[i]) t = minRightIndex[t];
            minRightIndex[i] = t;
        }
        int result = 0;
        for (int i = 0; i < size; i++) {
            int sum = heights[i] * (minRightIndex[i] - minLeftIndex[i] - 1);
            result = max(sum, result);
        }
        return result;
    }
};

单调栈做法：

class Solution {
public:
    int largestRectangleArea(vector<int>& heights) {
        stack<int> st;
        heights.insert(heights.begin(), 0); 
        heights.push_back(0); 
        st.push(0);
        int result = 0;
        // 第一个元素已经入栈，从下标1开始
        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 (heights[i] < heights[st.top()]) { 
                    int mid = st.top();
                    st.pop();
                    int left = st.top();
                    int right = i;
                    int w = right - left - 1;
                    int h = heights[mid];
                    result = max(result, w * h);
                }
                st.push(i);
            }
        }
        return result;
    }
};