LeetCode84. Largest Rectangle in Histogram——单调栈

一、题目

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;
    }
};