题目地址:
https://leetcode.com/problems/count-square-submatrices-with-all-ones/
给定一个 m × n m\times n m×n的 0 − 1 0-1 0−1矩阵 A A A,问其有多少个 1 1 1方阵。
如果能求出 f [ i ] [ j ] f[i][j] f[i][j], f [ i ] [ j ] f[i][j] f[i][j]是以 A [ i ] [ j ] A[i][j] A[i][j]为右下角的最大的 1 1 1方阵的边长(这个边长也等于以 A [ i ] [ j ] A[i][j] A[i][j]为右下角的 1 1 1方阵有多少个),那么很显然 ∑ f \sum f ∑f就是答案。考虑如何递推 f f f。首先如果 A [ i ] [ j ] = 0 A[i][j]=0 A[i][j]=0则 f [ i ] [ j ] = 0 f[i][j]=0 f[i][j]=0;否则 f [ i ] [ j ] = 1 + min { f [ i − 1 ] [ j ] , f [ i ] [ j − 1 ] , f [ i − 1 ] [ j − 1 ] } f[i][j]=1+\min\{f[i-1][j],f[i][j-1], f[i-1][j-1]\} f[i][j]=1+min{f[i−1][j],f[i][j−1],f[i−1][j−1]}。代码如下:
class Solution {
public:
int countSquares(vector<vector<int>>& m) {
int res = 0;
for (int i = 0; i < m.size(); i++)
for (int j = 0; j < m[0].size(); j++)
if (m[i][j]) {
if (i && j)
m[i][j] = min({m[i - 1][j], m[i][j - 1], m[i - 1][j - 1]}) + 1;
else
m[i][j] = 1;
res += m[i][j];
}
return res;
}
};
时间复杂度 O ( m n ) O(mn) O(mn),空间 O ( 1 ) O(1) O(1)。