LeetCode 221: Maximal Square

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[][]$，其中 $dp[i][j]$ 表示以点(i, j)为右下角的正方形的边长。状态转移方程为：

$$dp[i][j] = \begin{cases} 0, &\text{如果 matrix[i][j] = '0'.} \\ min(dp[i-1][j-1], min(dp[i-1][j], dp[i][j-1])) + 1, &\text{如果 matrix[i][j] = '1'.} \end{cases}$$
代码如下：

class Solution {
public:
    int maximalSquare(vector<vector<char>>& matrix) {
        if (matrix.size() == 0) 
            return 0;

        int maxEdge = 0;
        int M = matrix.size(), N = matrix[0].size();
        vector<vector<int>> dp(M + 1, vector<int>(N + 1, 0));
        for (int i = 1; i <= M; ++i) {
            for (int j = 1; j <= N; ++j) {
                if (matrix[i-1][j-1] == '1') {
                    dp[i][j] = min(dp[i-1][j-1], min(dp[i-1][j], dp[i][j-1])) + 1;
                }
                maxEdge = max(maxEdge, dp[i][j]);
            }
        }

        return maxEdge * maxEdge;
    }
};