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 0
Return 4.
中心思想:
Dynamic Programming
举一个例子,边长为2的正方形成为正方形的条件是其右下是1,左,左上,上都是1。所以,可是说是通过判断右下角1的左,左上,上来决定要不要width加1。
除了第一行和第一列,将每个位置上的数(如果是1)作为正方形的右下角来看待,标记了目前这个正方形最长的width。取其左,左上,上中最小的标记数,并加1表示加一层。
class Solution {
public:
int maximalSquare(vector<vector<char>>& matrix) {
if (matrix.size() == 0 || matrix[0].size() == 0)
return 0;
int n = matrix.size();
int m = matrix[0].size();
int maxWidth = 0;
int tmp[n][m];
for (int i = 0; i < m; i++){ //第一行
if (matrix[0][i] == '1'){
tmp[0][i] = 1;
maxWidth = 1;
}else{
tmp[0][i] = 0;
}
}
for (int i = 0; i < n; i++){ //第一列
if (matrix[i][0] == '1'){
tmp[i][0] = 1;
maxWidth = 1;
}else{
tmp[i][0] = 0;
}
}
for (int i = 1; i < n; i++){
for (int j = 1; j < m; j++){
if (matrix[i][j] == '0')
tmp[i][j] = 0;
else{
tmp[i][j] = min(tmp[i][j-1], min(tmp[i-1][j-1], tmp[i-1][j]))+1;
maxWidth = max(maxWidth, tmp[i][j]);
}
}
}
return maxWidth*maxWidth;
}
};