一、题目
给定一个仅包含 0 和 1 的二维二进制矩阵,找出只包含 1 的最大矩形,并返回其面积。
示例:
输入:
[
["1","0","1","0","0"],
["1","0","1","1","1"],
["1","1","1","1","1"],
["1","0","0","1","0"]
]
输出: 6
二、思路——单调栈
利用 84. 柱状图中最大的矩形 来解决这道题。
看下面的橙色部分,每一幅图都和 84 题是一样的。
图片来自 详细通俗的思路分析,多解法
因此,我们求出这个矩阵每一层的 heights[],再将该参数传给 84 题的函数即可。
三、代码
class Solution {
public int maximalRectangle(char[][] matrix) {
if(matrix.length == 0)
return 0;
int maxRectangle = 0;
int[] heights = new int[matrix[0].length];
// 计算每一层的heights
for(int row = 0; row < matrix.length; row++){
// 遍历每一列,更新高度
for(int col = 0; col < matrix[0].length; col++){
if(matrix[row][col] == '1')
heights[col]++;
else
heights[col] = 0;
}
maxRectangle = Math.max(maxRectangle, largestRectangleArea(heights));
}
return maxRectangle;
}
public int largestRectangleArea(int[] heights) {
int maxArea = 0;
int n = heights.length;
int[] new_heights = new int[n + 2];
for(int i = 1; i < n + 1; i++){
new_heights[i] = heights[i - 1];
}
LinkedList<Integer> stack = new LinkedList<>();
for(int i = 0; i < n + 2; i++){
while(!stack.isEmpty() && new_heights[stack.peek()] > new_heights[i]){
int cur = stack.pop();
maxArea = Math.max(maxArea, new_heights[cur] * (i - stack.peek() - 1));
}
stack.push(i);
}
return maxArea;
}
}