单调栈,当找到右边小于栈顶元素的值之后计算一次面积。
class Solution {
public:
int largestRectangleArea(vector<int>& heights) {
int n = heights.size();
vector<int> st;
int ans = 0;
heights.insert(heights.begin(), 0);
heights.push_back(0);
for(int i = 0; i < heights.size(); ++i){
while(!st.empty() && heights[st.back()] > heights[i]){
int cur = st.back();
st.pop_back();
int left = st.back();
int right = i;
ans = max(ans, (heights[cur] * (right - left - 1)));
}
st.push_back(i);
}
return ans;
}
};