-
Notifications
You must be signed in to change notification settings - Fork 0
/
221.maximal-square.java
47 lines (41 loc) · 1.59 KB
/
221.maximal-square.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
class Solution {
public int maximalSquare(char[][] matrix) {
//System.out.println(matrix.length +" hh ");
if(matrix.length == 1 && matrix[0].length == 0 || matrix.length == 0)
return 0;
if(matrix.length == 1 && matrix[0].length == 1){
if(matrix[0][0] == '1')
return 1;
else
return 0;
}
int prepare[][] = new int[matrix.length][matrix[0].length];
int res = 0;
for(int i=0;i<matrix.length;i++){
prepare[i][0] = matrix[i][0] == '1' ? 1: 0;
if(matrix[i][0] == '1')
res =1;
}
// for(int i=0;i<matrix.length;i++){
// for(int j=0;j<matrix[0].length;j++){
// System.out.println(prepare[i][j]+" "+i+" "+j);
// }}
for(int i=0;i<matrix[0].length;i++){
prepare[0][i] = matrix[0][i] == '1' ? 1: 0;
if(matrix[0][i] == '1')
res =1;
}
for(int i=1;i<matrix.length;i++){
for(int j=1;j<matrix[0].length;j++){
if(matrix[i][j] == '1')
prepare[i][j] = Math.min(prepare[i][j-1], Math.min(prepare[i-1][j-1], prepare[i-1][j])) + 1;
else
prepare[i][j] = 0;
// System.out.println(prepare[i][j]+" "+prepare[i][j-1]+" "+prepare[i-1][j]+" "+prepare[i-1][j-1]+" "+i+" "+j+" "+matrix[i][j]);
if(res < prepare[i][j])
res = prepare[i][j];
}
}
return res*res;
}
}