Description:
Given a m * n matrix of ones and zeros, return how many square submatrices have all ones.
Example 1:
Input: matrix =
[
[0,1,1,1],
[1,1,1,1],
[0,1,1,1]
]
Output: 15
Explanation:
There are 10 squares of side 1.
There are 4 squares of side 2.
There is 1 square of side 3.
Total number of squares = 10 + 4 + 1 = 15.
Example 2:
Input: matrix =
[
[1,0,1],
[1,1,0],
[1,1,0]
]
Output: 7
Explanation:
There are 6 squares of side 1.
There is 1 square of side 2.
Total number of squares = 6 + 1 = 7.
Constraints:
- 1 <= arr.length <= 300
- 1 <= arr[0].length <= 300
- 0 <= arr[i][j] <= 1
Analysis:
The problem is nearly the same to LeetCode 221. Maximal Square (Medium).
Here we also Initialize a 2D array dp
where dp[i][j]
represents the side length of the maximum square whose right bottom corner is the cell with index
(
i
,
j
)
(i,j)
(i,j) in the original matrix.
d
p
[
i
]
[
j
]
=
{
m
i
n
{
d
p
[
i
−
1
]
[
j
−
1
]
,
d
p
[
i
−
1
]
[
j
]
,
d
p
[
i
]
[
j
−
1
]
}
+
1
(
m
a
t
r
i
x
[
i
]
[
j
]
=
1
)
0
(
m
a
t
r
i
x
[
i
]
[
j
]
=
0
)
dp[i][j] = \begin{cases} min\{dp[i-1][j-1], dp[i-1][j], dp[i][j-1]\} + 1 \ (matrix[i][j] = 1) \\ 0 \ (matrix[i][j] = 0) \end{cases}
dp[i][j]={min{dp[i−1][j−1],dp[i−1][j],dp[i][j−1]}+1 (matrix[i][j]=1)0 (matrix[i][j]=0)
For each cell with index
(
i
,
j
)
(i, j)
(i,j) in the matrix, we can create dp[i][j]
different squares whose corner is the cell. So the answer to the problem is the sum of all elements in the array dp
.
Code:
class Solution {
public int countSquares(int[][] matrix) {
int M = matrix.length;
int N = matrix[0].length;
int[][] dp = new int[M][N];
for(int i = 0; i < M; i++) {
if(matrix[i][0] == 1) {
dp[i][0] = 1;
}
}
for(int j = 0; j < N; j++) {
if(matrix[0][j] == 1) {
dp[0][j] = 1;
}
}
// dp
for(int i = 1; i < M; i++) {
for(int j = 1; j < N; j++) {
if(matrix[i][j] == 1) {
int L = Math.min(dp[i-1][j-1], Math.min(dp[i-1][j], dp[i][j-1]));
dp[i][j] = L+1;
}
}
}
int sum = 0;
for(int i = 0; i < M; i++) {
for(int j = 0; j < N; j++) {
sum += dp[i][j];
}
}
return sum;
}
}