Thanks to visit codestin.com
Credit goes to github.com

Skip to content

Commit 8dbdc48

Browse files
committed
2019-12-09
1 parent 03696c4 commit 8dbdc48

File tree

2 files changed

+17
-13
lines changed

2 files changed

+17
-13
lines changed

.DS_Store

4 KB
Binary file not shown.

1277.统计全为1的正方形子矩阵/1277-统计全为1的正方形子矩阵.py

Lines changed: 17 additions & 13 deletions
Original file line numberDiff line numberDiff line change
@@ -4,22 +4,26 @@ def countSquares(self, matrix):
44
:type matrix: List[List[int]]
55
:rtype: int
66
"""
7+
if not matrix or not matrix[0]:
8+
return 0
9+
710
m, n = len(matrix), len(matrix[0])
8-
res = 0
911
dp = [[0 for _ in range(n)] for _ in range(m)]
10-
for i in range(m):
11-
dp[i][0] = matrix[i][0]
12-
res += dp[i][0]
13-
14-
for j in range(1, n):
15-
dp[0][j] = matrix[0][j]
16-
res += dp[0][j]
17-
12+
13+
res = 0
14+
for j in range(n):
15+
if matrix[0][j]:
16+
res += 1
17+
dp[0][j] = 1
18+
19+
for i in range(1, m):
20+
if matrix[i][0]:
21+
res += 1
22+
dp[i][0] = 1
23+
1824
for i in range(1, m):
1925
for j in range(1, n):
2026
if matrix[i][j]:
21-
dp[i][j] = min(dp[i - 1][j], dp[i - 1][j - 1], dp[i][j - 1]) + 1
27+
dp[i][j] = min(dp[i - 1][j - 1], dp[i - 1][j], dp[i][j - 1]) + 1
2228
res += dp[i][j]
23-
print dp
24-
return res
25-
29+
return res

0 commit comments

Comments
 (0)