【单调栈】按照每一个柱子的高度进行遍历,以每个柱子的高度为高的大矩形面积是由他和到左右第一个比他小的这个区间内的柱子组成的。举个🌰:2,6,5,7,3。我们看5这个,左边第一个比他小的是2,右边第一个比他小的是3,所以以5为高度的大矩形右6,5,7组成,所以我们求出每个柱子左右第一个比他小的矩形的下标,然后用区间长度和这个柱子高度相乘即可。
class Solution {
// 单调栈 2:49 14
// 寻找左右两侧第一个比自己小的坐标
public int largestRectangleArea(int[] heights) {
int n = heights.length;
int[] left = new int[n], right = new int[n];
Deque<Integer> stack = new LinkedList();
for (var i = 0; i < n; i++) {
while (!stack.isEmpty() && heights[stack.peek()] >= heights[i]) stack.pop();
if (stack.isEmpty()) left[i] = -1;
else left[i] = stack.peek();
stack.push(i);
}
stack.clear();
for (var i = n - 1; i >= 0; i--) {
while (!stack.isEmpty() && heights[stack.peek()] >= heights[i]) stack.pop();
if (stack.isEmpty()) right[i] = n;
else right[i] = stack.peek();
stack.push(i);
}
int ans = 0;
for (var i = 0; i < n; i++) {
ans = Math.max(ans, heights[i] * (right[i] - left[i] - 1));
}
return ans;
}
}
class Solution {
public:
// 单调栈
// 3:26 8
int max(int a, int b) { return a > b? a: b; }
int largestRectangleArea(vector<int>& heights) {
int n = heights.size();
int left[n], right[n];
stack<int> s;
for (int i = 0; i < n; i++) {
while (!s.empty() && heights[s.top()] >= heights[i]) s.pop();
if (s.empty()) left[i] = -1;
else left[i] = s.top();
s.push(i);
}
s = stack<int>();
for (int i = n - 1; i >= 0; i--) {
while (!s.empty() && heights[s.top()] >= heights[i]) s.pop();
if (s.empty()) right[i] = n;
else right[i] = s.top();
s.push(i);
}
int ans = 0;
for (int i = 0; i < n; i++) {
ans = max(ans, heights[i] * (right[i] - left[i] - 1));
}
return ans;
}
};