原文地址:http://blog.csdn.net/brucehb/article/details/46384411
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.
解题思路:
动态规划(Dynamic Programming)
状态转移方程:
dp[x][y] = min(dp[x - 1][y - 1], dp[x][y - 1], dp[x - 1][y]) + 1
上式中,dp[x][y]表示以坐标(x, y)为右下角元素的全1矩阵的最大长度(宽度)
class Solution {
public:
int maximalSquare(vector<vector<char>>& matrix) {
int m=matrix.size();
if(m<1)
return 0;
int n=matrix[0].size();
if(n<1)
return 0;
vector<vector<int> > size(m,vector<int>(n,0));
int maxSize=0;
for(int i=0;i<m;i++)
{
if(matrix[i][0]=='1')
{
size[i][0]=1;
maxSize=1;
}
}
for(int i=0;i<n;i++)
{
if(matrix[0][i]=='1')
{
size[0][i]=1;
maxSize=1;
}
}
for(int i=1;i<m;i++)
{
for(int j=1;j<n;j++)
{
if(matrix[i][j]=='1')
{
size[i][j]=min(size[i-1][j-1],min(size[i-1][j],size[i][j-1]))+1;
maxSize=max(maxSize,size[i][j]);
}
}
}
return maxSize*maxSize;
}
};