在一个由 ‘0’ 和 ‘1’ 组成的二维矩阵内,找到只包含 ‘1’ 的最大正方形,并返回其面积。
示例:
输入:matrix = [["1","0","1","0","0"],
["1","0","1","1","1"],
["1","1","1","1","1"],
["1","0","0","1","0"]]
输出:4
思路:dp[i][j]表示以点(i,j)为右下角的正方形的边长。以点(i,j)为右下角的最大正方形取决于左边的点(i,j-1),左上的点(i-1,j-1)和上边的点(i-1,j)做为右下角时的正方形的大小。我也不知道怎么论证,你可以当成是客观事实记下来。在代码中表现为:dp[i][j] = min(dp[i - 1][j - 1], dp[i - 1][j], dp[i][j - 1]) + 1。本题难的就是状态转移方程的推导,其他的就是动态规划的常规套路。因为只用到了当前行和上一行的数据,空间上还可以再做优化。
int maximalSquare(vector<vector<char>>& matrix) {
int m = matrix.size(), n = matrix[0].size(), sz = 0;
vector<vector<int>> dp(m, vector<int>(n));
for (int i = 0; i < m; i++) {
for (int j = 0; j < n; j++) {
if (!i || !j || matrix[i][j] == '0') {
dp[i][j] = matrix[i][j] - '0';
} else {
dp[i][j] = min(dp[i - 1][j - 1], min(dp[i - 1][j], dp[i][j - 1])) + 1;
}
sz = max(dp[i][j], sz);
}
}
return sz * sz;
}
空间复杂度优化为O(n)
int maximalSquare(vector<vector<char>>& matrix) {
int m = matrix.size(), n = matrix[0].size(), sz = 0,pre;
vector<int> dp(n);
for (int i = 0; i < m; i++) {
for (int j = 0; j < n; j++) {
int tmp=dp[j];
if (!i || !j || matrix[i][j] == '0') {
dp[j] = matrix[i][j] - '0';
} else {
dp[j] = min(dp[j - 1], min(dp[j], pre)) + 1;
}
sz = max(dp[j], sz);
pre=tmp;
}
}
return sz * sz;
}