一、题目内容

二、题解

解法1：

思路

dp求最小边长

代码

public class Solution {
    public int solve (char[][] matrix) {
        // write code here
        if(matrix == null||matrix.length==0){
            return 0;
        }
        int row = matrix.length;
        int column = matrix[0].length;
        int[][] dp = new int[row+1][column+1];
        int maxans = 0;
        for(int i = 1;i<=row;i++){
            for(int j = 1;j<=column;j++){
                if(matrix[i-1][j-1] == '1'){
                    dp[i][j] = Math.min(dp[i-1][j-1],Math.min(dp[i-1][j],dp[i][j-1]))+1;
                    maxans = Math.max(maxans,dp[i][j]);
                }
            }
        }
        return maxans*maxans;
    }
}