柱状图中最大的矩形
难度困难783
给定 n 个非负整数,用来表示柱状图中各个柱子的高度。每个柱子彼此相邻,且宽度为 1 。
求在该柱状图中,能够勾勒出来的矩形的最大面积。
以上是柱状图的示例,其中每个柱子的宽度为 1,给定的高度为 [2,1,5,6,2,3]
。
图中阴影部分为所能勾勒出的最大矩形面积,其面积为 10
个单位
示例:
输入: [2,1,5,6,2,3]输出: 10
方法一:暴力
固定高度,向两边找边
public int largestRectangleArea(int[] heights) {
int maxArea = 0;
for (int i = 0; i < heights.length; i++) {
int left = 0;
int right = heights.length - 1;
for(int j = i - 1; j >= 0; j--) {
if (heights[j] < heights[i]) {
left = j + 1;
break;
}
}
for(int j = i + 1; j < heights.length; j++) {
if (heights[j] < heights[i]) {
right = j - 1;
break;
}
}
maxArea = Math.max(maxArea, heights[i] * (right -left + 1));
}
return maxArea;
}
固定边
public int largestRectangleArea(int[] heights) {
int maxArea = 0;
for (int i = 0; i < heights.length; i++) {
int minHeight = heights[i];
for (int j = i; j <heights.length; j++) {
minHeight = Math.min(minHeight, heights[j]);
maxArea = Math.max(maxArea, minHeight * (j - i + 1));
}
}
return maxArea;
}
方法二:单调栈
public int largestRectangleArea(int[] heights) {
int maxArea = 0;
Stack<Integer> stack = new Stack<>();
for (int i = 0; i < heights.length; i++) {
while (!stack.isEmpty() && heights[stack.peek()] >= heights[i]) {
int height = heights[stack.pop()];
int width;
if (stack.isEmpty()) {
width = i;
} else {
width = i - stack.peek() - 1;
}
maxArea = Math.max(maxArea, height * width);
}
stack.push(i);
}
while (!stack.isEmpty()) {
int height = heights[stack.pop()];
int width;
if (stack.isEmpty()) {
width = heights.length;
} else {
width = heights.length - stack.peek() - 1;
}
maxArea = Math.max(maxArea, height * width);
}
return maxArea;
}
哨兵
public int largestRectangleArea(int[] heights) {
int len = heights.length;
int maxArea = 0;
Stack<Integer> stack = new Stack<>();
int[] newHeights = new int[len + 2];
System.arraycopy(heights, 0, newHeights, 1, len);
heights = newHeights;
len += 2;
stack.push(0);
for (int i = 1; i < len; i++) {
while (heights[i] < heights[stack.peek()]) {
int height = heights[stack.pop()];
int width = i - stack.peek() - 1;
maxArea = Math.max(maxArea, height * width);
}
stack.push(i);
}
return maxArea;
}