最大正方形

分析

dp[i][j]表示以（i,j）为正方形右下角的最大边长，那么存在 d p [ i ] [ j ] = m i n { d p [ i − 1 ] [ j ] , d p [ i ] [ j − 1 ] , d p [ i − 1 ] [ j − 1 ] } + 1 dp[i][j] = min\{dp[i-1][j],dp[i][j-1],dp[i-1][j-1]\}+1 dp[i][j]=min{dp[i−1][j],dp[i][j−1],dp[i−1][j−1]}+1

import java.util.*;


public class Solution {
    /**
     * 最大正方形
     * @param matrix char字符型二维数组 
     * @return int整型
     */
    public int solve (char[][] matrix) {
        // write code here
        int row = matrix.length;
        int col = matrix[0].length;
        int[][] dp = new int[row][col];
        int res = 1;
        //初始化dp矩阵
        for(int i = 0; i < col; i++) {
            dp[0][i] = matrix[0][i] == '1' ? 1:0;
        }
        for(int i = 0; i < row; i++) {
            dp[i][0] = matrix[i][0] == '1' ? 1:0;
        }
        for(int i = 1; i < row; i++) {
            for(int j = 1; j < col; j++) {
                if(matrix[i][j] == '1') {
                    dp[i][j] = Math.min(Math.min(dp[i][j-1],dp[i-1][j]),dp[i-1][j-1]) + 1;
                    res = Math.max(res,dp[i][j]);
                }
            }
        }
        return res * res;
    }
}