- 最大正方形
在一个由 ‘0’ 和 ‘1’ 组成的二维矩阵内,找到只包含 ‘1’ 的最大正方形,并返回其面积。
class Solution {
public:
int maximalSquare(vector<vector<char>>& matrix) {
int size1 = matrix.size();
if (size1 == 0) {
return 0;
}
int size2 = matrix[0].size();
int dp[size1+1][size2+1];
int maxV = 0;
for (int i = 0; i < size1; i++) {
if (matrix[i][0] == '1') {
maxV = 1;
dp[i][0] = 1;
}
else
dp[i][0] = 0;
}
for (int i = 0; i < size2; i++) {
if (matrix[0][i] == '1') {
maxV = 1;
dp[0][i] = 1;
}
else
dp[0][i] = 0;
}
for (int i = 1; i < size1; i++) {
for (int j = 1; j < size2; j++) {
if (matrix[i][j] == '0') {
dp[i][j] = 0;
} else {
int left = dp[i][j-1];
int up = dp[i-1][j];
int ul = dp[i-1][j-1];
int len = min(sqrt(dp[i][j-1]), min(sqrt(dp[i-1][j]), sqrt(dp[i-1][j-1])));
dp[i][j] = (len+1) * (len+1);
maxV = max(maxV, dp[i][j]);
}
}
}
return maxV;
}
};