leetcode 221. 最大正方形

dp[i][j]表示这个点的最大正方形边长
public class Solution {
    public int maximalSquare(char[][] matrix) {
        int rows = matrix.length, cols = rows > 0 ? matrix[0].length : 0;
        int[][] dp = new int[rows + 1][cols + 1];
        int maxsqlen = 0;
        for (int i = 1; i <= rows; i++) {
            for (int j = 1; j <= cols; j++) {
                if (matrix[i-1][j-1] == '1'){
                    dp[i][j] = Math.min(Math.min(dp[i][j - 1], dp[i - 1][j]), dp[i - 1][j - 1]) + 1;
                    maxsqlen = Math.max(maxsqlen, dp[i][j]);
                }
            }
        }
        return maxsqlen * maxsqlen;
    }
}

滚动数组优化dp
class Solution {
public:
    int maximalSquare(vector<vector<char>>& matrix) {
        int n=matrix.size();
        if(!n) return 0;
        int m=matrix[0].size();
        vector<int> dp(m+10);
        int pre=0;
        int tmp=0;
        int len=0;
        for(int i=1;i<=n;i++)
        {
            for(int j=1;j<=m;j++)
            {
                tmp=dp[j];
                if(matrix[i-1][j-1] == '1') dp[j]=min(dp[j],min(dp[j-1],pre))+1;
                else dp[j]=0;
                len=max(len,dp[j]);
                pre=tmp;
            }
        }
        return len*len;
    }
};