221. 最大正方形

设置二维数组dp。dp[i][j]表示以[i][j]为右下角的全1正方形的最大边长。
观察发现，当matrix[i][j] == '0'时dp[i][j] = 0；当matrix[i][j] == '1'时状态转移方程dp[i][j] = min {dp[i][j-1], dp[i-1][j], dp[i-1][j-1]} + 1，即当前位置的左、上以及左上能构成的最大正方形的边长+1。实现代码如下：

class Solution {
    public int maximalSquare(char[][] matrix) {
        if(matrix == null || matrix.length == 0)
            return 0;
        int row = matrix.length, column = matrix[0].length, maxLength = 0;
        int[][] dp = new int[row][column];
        for (int i = 0; i < row; i++) {
            for (int j = 0; j < column; j++) {
                if(matrix[i][j] == '1')
                    dp[i][j] = 1;
                if(dp[i][j] != 0) {
                    int up = i == 0? 0: dp[i - 1][j],
                            left = j == 0? 0: dp[i][j - 1],
                            corner = (i == 0 || j == 0)? 0: dp[i-1][j-1];
                    dp[i][j] = Math.min(up, Math.min(left, corner)) + 1;
                    maxLength = Math.max(maxLength, dp[i][j]);
                }
            }
        }
        return maxLength * maxLength;
    }
}