LeetCode221. 最大正方形（DP动态规划）

https://leetcode-cn.com/problems/maximal-square/
在一个由 0 和 1 组成的二维矩阵内，找到只包含 1 的最大正方形，并返回其面积。

示例:

输入: 

1 0 1 0 0
1 0 1 1 1
1 1 1 1 1
1 0 0 1 0

输出: 4

class Solution {
public:
    int maximalSquare(vector<vector<char>>& matrix) {
        int row = matrix.size();
        if(!row) return 0;
        int col = matrix[0].size();
        if(!col) return 0;
        //int dp[row][col] = {0};
        vector<vector<int>> dp(row, vector<int> (col, 0));
        int maxdp = 0;
        bool flag = false;
        //边界条件
        for(int i = 0; i < row; i++) {
            if(matrix[i][0] == '1') {
                dp[i][0] = 1;
                flag = true;
            }
        }
        for(int i = 0; i < col; i++) {
            if(matrix[0][i] == '1') {
                dp[0][i] = 1;
                flag = true;
            }
        }
        if(flag) maxdp = 1;
        for(int i = 1; i < row; i++) {
            for(int j = 1; j < col; j++) {
                if(matrix[i][j] == '1') {
                    dp[i][j] = min(dp[i - 1][j], min(dp[i][j - 1], dp[i - 1][j - 1])) + 1;
                }
                maxdp = max(maxdp, dp[i][j]);
            }
        }
        return maxdp * maxdp;
    }
};

/*class Solution {
public:
    int maximalSquare(vector<vector<char>>& matrix) {
        if (matrix.size() == 0 || matrix[0].size() == 0) {
            return 0;
        }
        int maxSide = 0;
        int rows = matrix.size(), columns = matrix[0].size();
        vector<vector<int>> dp(rows, vector<int>(columns));
        for (int i = 0; i < rows; i++) {
            for (int j = 0; j < columns; j++) {
                if (matrix[i][j] == '1') {
                    if (i == 0 || j == 0) {
                        dp[i][j] = 1;
                    } else {
                        dp[i][j] = min(min(dp[i - 1][j], dp[i][j - 1]), dp[i - 1][j - 1]) + 1;
                    }
                    maxSide = max(maxSide, dp[i][j]);
                }
            }
        }
        int maxSquare = maxSide * maxSide;
        return maxSquare;
    }
};*/