221. Maximal Square

Given a 2D binary matrix filled with 0's and 1's, find the largest square containing all 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.

思路:这是一个dp题，对于dp[i][j],如果nums[i][j]=0,那个dp[i][j]=0，如果nums[i][j]=1,dp[i][j]=mininthree(dp[i-1][j],dp[i][j-1],dp[i-1][j-1])+1;

注意别忘了对第一行和第一列的dp[i][j]初始化

代码如下(已通过leetcode)

public class Solution {
   public int maximalSquare(char[][] matrix) {
    if(matrix==null||matrix.length==0) return 0;
    int m=matrix.length;
    int n=matrix[0].length;
    int max=0;
    int[][] dp=new int[m][n];
    for(int i=0;i<m;i++) {
    dp[i][0]=matrix[i][0]-'0';
    max=Math.max(max, dp[i][0]);
    }
    for(int i=0;i<n;i++) {
    dp[0][i]=matrix[0][i]-'0';
    max=Math.max(max, dp[0][i]);
    }
    for(int i=1;i<m;i++) {
    for(int j=1;j<n;j++) {
    if(matrix[i][j]=='0') dp[i][j]=0;
    else {
    dp[i][j]=mininthree(dp[i-1][j], dp[i][j-1], dp[i-1][j-1])+1;
    max=Math.max(max, dp[i][j]);
    } 
    }
    }
    return max*max;
   }
   
   public int mininthree(int a,int b,int c) {
    if(a<b) {
    if(a<c) return a;
    else return c;
    } else {
    if(b<c) return b;
    else return c;
    }
   }
}