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
| class Solution { public int maximalSquare(char[][] matrix) { int m = matrix.length, n = matrix[0].length;
int[][] dp = new int[m][n]; int maxSide = 0;
for (int i = 0; i < m; i++) { for (int j = 0; j < n; j++) { if (matrix[i][j] == '1') { if (i == 0 || j == 0) { dp[i][j] = 1; } else { dp[i][j] = Math.min(dp[i - 1][j - 1], Math.min(dp[i][j - 1], dp[i - 1][j])) + 1; }
maxSide = Math.max(maxSide, dp[i][j]); } } }
return maxSide * maxSide; } }
|