【LeetCode】Largest Rectangle in Histogram

Given n non-negative integers representing the histogram's bar height where the width of each bar is 1, find the area of largest rectangle in the histogram.

 

Above is a histogram where width of each bar is 1, given height = [2,1,5,6,2,3].

 

The largest rectangle is shown in the shaded area, which has area = 10 unit.

 

Example:

Input: [2,1,5,6,2,3]
Output: 10

思路：典型的单调栈，维护一个单调递增栈，因为栈顶只有遇到更小的时候才会更新所以留在栈里的必须是递增的，pop的时候更新栈顶元素能形成的最大面积，这里要注意push进去的是下标，这里为了方便把0push到数组中用来方便更新最后一个元素,

这里注意对每个pop出来的元素更新时候要准确求出左右的长度为当前位置i到栈顶下一个栈顶的位置之间的距离注意判空

class Solution {
public:
    int largestRectangleArea(vector<int>& heights) {
        int res=0,n=heights.size();
        heights.push_back(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();
               res=max(res,heights[cur]*(st.empty()?i:(i-st.top()-1)));

           }
            st.push(i);
        }
        return res;
    }
};