84.柱状图中最大的矩形
用单调栈做,跟接雨水类似,只不过这个栈里的顺序是从大到小。
代码随想录题解
class Solution {
public:
int largestRectangleArea(vector<int>& heights) {
stack<int> st;
heights.insert(heights.begin(), 0);
heights.push_back(0);//首尾补零
st.push(0);
int result = 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.pop();
st.push(i);
} else {
while (heights[i] < heights[st.top()]) {
int mid = st.top();
st.pop();
int left = st.top();
int right = i;
int h = heights[mid];
int w = i - st.top() - 1; //不算左右两边矮的
result = max(result, h * w);
}
st.push(i);
}
}
return result;
}
};