class Solution {
public:
int maximalSquare(vector<vector<char>>& matrix) {
int Y = matrix.size();
int X = matrix[0].size();
int ans = 0;
vector<vector<int> > dp(Y+1, vector<int>(X+1, 0));
for(int yy = 1; yy <= Y; yy++) {
for(int xx = 1; xx <= X; xx++) {
if(matrix[yy-1][xx-1] == '1') {
dp[yy][xx] = min(min(dp[yy-1][xx], dp[yy][xx-1]), dp[yy-1][xx-1]) + 1;
ans = max(ans, dp[yy][xx]);
}
}
}
return ans * ans;
}
};
leetcode 221. 最大正方形
最新推荐文章于 2024-06-22 15:59:44 发布