leetcode 221. 最大正方形（java）

感谢官方题解 

从暴力法到为了降低时间复杂度转换为动态规划

class Solution {
    public int maximalSquare(char[][] matrix) {
        int maxside = 0;
        int row = matrix.length;
        int col = matrix[0].length;
        if(matrix == null || row == 0 || col == 0) return maxside;

        int[][] dp = new int[row][col];
        for(int i = 0; i < row; i ++){
            for(int j = 0; j < col; j ++){
                if(matrix[i][j] == '1'){
                    if(i == 0 || j == 0){
                        dp[i][j] = 1;
                    }else{
                        dp[i][j] = Math.min(Math.min(dp[i - 1][j], dp[i][j - 1]), dp[i - 1][j - 1]) + 1;
                    }
                    maxside = Math.max(maxside, dp[i][j]);
                }
            }
        }
        int ans = maxside * maxside;
        return ans;
    }
}