题目:
Given a 2D binary matrix filled with 0's and 1's, find the largest square containing only 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 0Return 4.
思路:别人的dp求解方法,学习,dp[i][j]表示以(i,j)为右下角的正方形的最大边长,状态方程转移为,不以第i行和第j列的最大正方形,也就是dp[i-1][j-1]的值,和以(i,j)为角的值的最小。
代码如下:
class Solution {
public:
int maximalSquare(vector<vector<char>>& matrix) {
int height=matrix.size();
if(height==0)
return 0;
int width=matrix[0].size();
vector<vector<int>> vec(height,vector<int>(width,0));
int result=0;
for(int i=0;i<height;i++)
{
for(int j=0;j<width;j++)
{
if(matrix[i][j]=='1')
{
vec[i][j]=1;
if(i>0&&j>0)
vec[i][j]+=min(min(vec[i-1][j],vec[i][j-1]),vec[i-1][j-1]);
}
result=max(result,vec[i][j]);
}
}
return result*result;
}
};