-
Notifications
You must be signed in to change notification settings - Fork 0
/
leetcode221.java
42 lines (36 loc) · 1.09 KB
/
leetcode221.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
public class Solution {
public int maximalSquare(char[][] matrix) {
if(matrix == null || matrix.length == 0 || matrix[0].length == 0)
return 0;
int m = matrix.length;
int n = matrix[0].length;
int[][] dp = new int [m][n];
for(int i = 0; i < m; i++){
if(matrix[i][0] == '1'){
dp[i][0] = 1;
}
}
for(int j = 0; j < n; j++){
if(matrix[0][j] == '1'){
dp[0][j] = 1;
}
}
for(int i = 1; i < m; i++){
for(int j = 1; j < n; j++){
if(matrix[i][j] == '0'){
dp[i][j] = 0;
}
else{
dp[i][j] = Math.min(Math.min(dp[i-1][j], dp[i][j-1]), dp[i-1][j-1]) + 1;
}
}
}
int max = Integer.MIN_VALUE;
for(int i = 0; i < m; i++){
for(int j = 0; j < n; j++){
max = Math.max(max, dp[i][j]);
}
}
return max*max;
}
}