-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path221.py
65 lines (52 loc) · 2.25 KB
/
221.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
"""
在一个由 0 和 1 组成的二维矩阵内,找到只包含 1 的最大正方形,并返回其面积。
示例:
输入:
1 0 1 0 0
1 0 1 1 1
1 1 1 1 1
1 0 0 1 0
输出: 4
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/maximal-square
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
"""
from typing import List
class Solution:
def maximalSquare(self, matrix: List[List[str]]) -> int:
if not matrix:
return 0
num_rows, num_cols = len(matrix), len(matrix[0])
# maxima_square_edge[i][j] 表示以 i,j 位置为结束的最大正方形边长
maxima_square_edge = [[0] * num_cols for _ in range(num_rows)]
for row in range(num_rows):
for col in range(num_cols):
if (row == 0) or (col == 0) or (matrix[row - 1][col - 1] == 0) or (matrix[row][col] == '0'):
maxima_square_edge[row][col] = 1 if matrix[row][col] == '1' else 0
else:
'''
last_edge = maxima_square_edge[row - 1][col - 1]
# check 从 matrix[row][col] 到 matrix[row][col-edge] 有多少个连续的 1
current_edge = 0
for idx in range(0, last_edge + 1):
if (matrix[row][col - idx] == '0') or (matrix[row - idx][col] == '0'):
break
current_edge += 1
maxima_square_edge[row][col] = current_edge
'''
maxima_square_edge[row][col] = min(maxima_square_edge[row-1][col-1],
maxima_square_edge[row][col-1],
maxima_square_edge[row-1][col]) + 1
max_edge = max(map(max,maxima_square_edge))
return max_edge * max_edge
matrix = [["1", "0", "1", "0", "0"],
["1", "0", "1", "1", "1"],
["1", "1", "1", "1", "1"],
["1", "0", "0", "1", "0"]]
matrix = []
matrix = [["0", "0", "0", "1"],
["1", "1", "0", "1"],
["1", "1", "1", "1"],
["0", "1", "1", "1"],
["0", "1", "1", "1"]]
print(Solution().maximalSquare(matrix))