Given a 2D binary matrix filled with 0’s and 1’s, find the largest square containing only 1’s and return its area.
Example:
Input:
1 0 1 0 0
1 0 1 1 1
1 1 1 1 1
1 0 0 1 0
Output: 4
求在0和1组成的数组中,由1填充组成的正方形的最大面积
以当前点(i,j)为右下角的正方形,如果(i-1,j-1)为右下角的正方形存在,则检查以下(i-1,j-1)为右下角的正方形的右侧和下侧的点是否为1
class Solution {
public int maximalSquare(char[][] matrix) {
int n = matrix.length;
if(n < 1) {
return 0;
}
int m = matrix[0].length;
if(m < 1) {
return 0;
}
int[][] dp = new int[n][m];
int max = 0;
for(int i = 0; i < n; i++) {
if(matrix[i][0] == '1') {
dp[i][0] = 1;
max = 1;
}
}
for(int i = 0; i < m; i++) {
if(matrix[0][i] == '1') {
dp[0][i] = 1;
max = 1;
}
}
for(int i = 1; i < n; i++) {
for(int j = 1; j < m; j++) {
if(matrix[i][j] == '0') {
dp[i][j] =0;
continue;
}
int l = dp[i - 1][ j - 1];
int minM = 0;
int minN = 0;
boolean fm = true;
boolean fn = true;
for(int k = 1; k < l + 1; k++) {
if(matrix[i][j - k] == '1' && fm) {
minM++;
} else {
fm = false;
}
if(matrix[i - k][j] == '1' && fn) {
minN++;
} else {
fn = false;
}
}
dp[i][j] = Math.min(Math.min(l, minM), minN) + 1;
max = Math.max(dp[i][j], max);
}
}
return max * max;
}
}