目录
84 柱状图中最大的矩形
class Solution {
public:
int largestRectangleArea(vector<int>& heights) {
stack<int> st;
int result = 0;
heights.insert(heights.begin(), 0);
heights.push_back(0);
st.push(0);
//本题是单调递减栈
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.push(i);
}else{
while(!st.empty() && heights[i] < heights[st.top()]){
int mid = st.top();
st.pop();
if(!st.empty()){
int left = st.top();
int right = i;
int h = heights[mid];
int w = right - left - 1;
result = max(h * w, result);
}
}
st.push(i);
}
}
return result;
}
};