LeetCode84 - 柱状图中最大的矩形
链接:https://leetcode-cn.com/problems/largest-rectangle-in-histogram
给定 n 个非负整数,用来表示柱状图中各个柱子的高度。每个柱子彼此相邻,且宽度为 1 。
求在该柱状图中,能够勾勒出来的矩形的最大面积。
以上是柱状图的示例,其中每个柱子的宽度为 1,给定的高度为 [2,1,5,6,2,3]。
图中阴影部分为所能勾勒出的最大矩形面积,其面积为 10 个单位。
示例:
输入: [2,1,5,6,2,3]
输出: 10
解法一、单调栈+哨兵、找出每个矩形的左右边界(以矩形为高,横坐标的范围)
class Solution {
public int largestRectangleArea(int[] heights) {
if(heights == null || heights.length == 0) return 0;
// 单调栈问题,就是找到每个矩形的左右边界
// 借助栈记录左边、右边的下标
Stack<Integer> helpStack = new Stack<>();
int[] left = new int[heights.length];
int[] right = new int[heights.length];
// 从左到右
for(int i=0; i< heights.length; i++) {
while(!helpStack.isEmpty() && heights[helpStack.peek()] > heights[i]) {
helpStack.pop();
}
left[i] = helpStack.isEmpty()?-1:helpStack.peek();
helpStack.push(i);
}
helpStack.clear();
// 从右到左
for(int i= heights.length-1; i>=0; i--) {
while(!helpStack.isEmpty() && heights[helpStack.peek()] >= heights[i]) {
helpStack.pop();
}
right[i] = helpStack.isEmpty()?heights.length:helpStack.peek();
helpStack.push(i);
} int max = 0;
for(int i=0; i< heights.length; i++) {
max = Math.max(max, (right[i] - left[i] - 1)* heights[i]);
}
return max;
}
}
解法二、优化(只遍历一次就找出左右边界范围)
class Solution {
public int largestRectangleArea(int[] heights) {
if(heights == null || heights.length == 0) return 0;
// 单调栈问题,就是找到每个矩形的左右边界
// 借助栈记录左边、右边的下标
Stack<Integer> helpStack = new Stack<>();
int[] left = new int[heights.length];
int[] right = new int[heights.length];
Arrays.fill(right,heights.length);
// 从左到右
for(int i=0; i< heights.length; i++) {
while(!helpStack.isEmpty() && heights[helpStack.peek()] >= heights[i]) {
right[helpStack.peek()] = i;
helpStack.pop();
}
left[i] = helpStack.isEmpty()?-1:helpStack.peek();
helpStack.push(i);
}
int max = 0;
for(int i=0; i< heights.length; i++) {
max = Math.max(max, (right[i] - left[i] - 1)* heights[i]);
}
return max;
}
}