LeetCode84. Largest Rectangle in Histogram——单调栈

最新推荐文章于 2024-07-01 15:10:19 发布

叶卡捷琳堡

最新推荐文章于 2024-07-01 15:10:19 发布

阅读量436

点赞数 10

文章标签：算法数据结构 leetcode c++ 单调栈

本文链接：https://blog.csdn.net/weixin_46841376/article/details/135859771

版权

本文介绍了如何使用动态规划和堆栈数据结构解决一个编程问题，即在给定一组高度的数组表示的直方图中找到最大的矩形面积。通过遍历数组并维护一个堆栈，计算每个可能的最大矩形面积并更新结果。

摘要由CSDN通过智能技术生成

文章目录

- 一、题目
- 二、题解

一、题目

Given an array of integers heights representing the histogram’s bar height where the width of each bar is 1, return the area of the largest rectangle in the histogram.

Example 1:

Input: heights = [2,1,5,6,2,3]
Output: 10
Explanation: The above is a histogram where width of each bar is 1.
The largest rectangle is shown in the red area, which has an area = 10 units.
Example 2:

Input: heights = [2,4]
Output: 4

Constraints:

1 <= heights.length <= 105
0 <= heights[i] <= 104

二、题解

class Solution {
public:
    int largestRectangleArea(vector<int>& heights) {
        int n = heights.size();
        int res = 0;
        stack<int> st;
        for(int i = 0;i < n;i++){
            while(!st.empty() && heights[i] <= heights[st.top()]){
                int cur = st.top();
                st.pop();
                int left = st.empty() ? -1 : st.top();
                res = max(res,(i - left - 1) * heights[cur]);
            }
            st.push(i);
        }
        while(!st.empty()){
            int cur = st.top();
            st.pop();
            int left = st.empty() ? -1 : st.top();
            res = max(res,(n - left - 1) * heights[cur]);
        }
        return res;
    }
};