LeetCode 221. Maximal Square(java)

Given a 2D binary matrix filled with 0’s and 1’s, find the largest square containing only 1’s and return its area.

For example, given the following matrix:

1 0 1 0 0
1 0 1 1 1
1 1 1 1 1
1 0 0 1 0

Return 4.

解法：动态规划，新建一个m+1, n+1大小的dp矩阵，然后从（1，1）点开始填数，原矩阵从（0，0）开始遍历，当原矩阵中的数为1时，我们更新dp矩阵的数字为左上角的三个数字的最小值+1，dp矩阵中存的数字为构成一个squre的边长大小，每次更新dp矩阵的某个数值时都update一下最长length，填完dp矩阵后输出边长的平方即可。

代码：

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