leet-code/src/main/java/leetcode/editor/cn/MaximalRectangle.java
2021-06-03 16:20:51 +08:00

103 lines
2.3 KiB
Java
Raw Blame History

This file contains ambiguous Unicode characters

This file contains Unicode characters that might be confused with other characters. If you think that this is intentional, you can safely ignore this warning. Use the Escape button to reveal them.

//给定一个仅包含 0 和 1 、大小为 rows x cols 的二维二进制矩阵,找出只包含 1 的最大矩形,并返回其面积。
//
//
//
// 示例 1
//
//
//输入matrix = [["1","0","1","0","0"],["1","0","1","1","1"],["1","1","1","1","1"]
//,["1","0","0","1","0"]]
//输出6
//解释:最大矩形如上图所示。
//
//
// 示例 2
//
//
//输入matrix = []
//输出0
//
//
// 示例 3
//
//
//输入matrix = [["0"]]
//输出0
//
//
// 示例 4
//
//
//输入matrix = [["1"]]
//输出1
//
//
// 示例 5
//
//
//输入matrix = [["0","0"]]
//输出0
//
//
//
//
// 提示:
//
//
// rows == matrix.length
// cols == matrix[0].length
// 0 <= row, cols <= 200
// matrix[i][j] 为 '0' 或 '1'
//
// Related Topics 栈 数组 哈希表 动态规划
// 👍 935 👎 0
package leetcode.editor.cn;
//85:最大矩形
public class MaximalRectangle {
public static void main(String[] args) {
//测试代码
Solution solution = new MaximalRectangle().new Solution();
}
//力扣代码
//leetcode submit region begin(Prohibit modification and deletion)
class Solution {
public int maximalRectangle(char[][] matrix) {
int m = matrix.length;
if (m == 0) {
return 0;
}
int n = matrix[0].length;
int[][] left = new int[m][n];
for (int i = 0; i < m; i++) {
for (int j = 0; j < n; j++) {
if (matrix[i][j] == '1') {
left[i][j] = (j == 0 ? 0 : left[i][j - 1]) + 1;
}
}
}
int ret = 0;
for (int i = 0; i < m; i++) {
for (int j = 0; j < n; j++) {
if (matrix[i][j] == '0') {
continue;
}
int width = left[i][j];
int area = left[i][j];
for (int k = i - 1; k >= 0; k--) {
width = Math.min(width, left[k][j]);
area = Math.max(area, (i - k + 1) * width);
}
ret = Math.max(ret, area);
}
}
return ret;
}
}
//leetcode submit region end(Prohibit modification and deletion)
}