Given a
m * n
matrix of ones and zeros, return how many square submatrices have all ones.
Constraints:
1 <= arr.length <= 300
1 <= arr[0].length <= 300
0 <= arr[i][j] <= 1
給予一個
m * n
且只有零和一的陣列,回傳裡面有多少用一組成的正方形。
限制:
1 <= arr.length <= 300
1 <= arr[0].length <= 300
0 <= arr[i][j] <= 1
LeetCode
C++