Leetcode 221. 最大正方形
中等题
题目
在一个由 ‘0’ 和 ‘1’ 组成的二维矩阵内,找到只包含 ‘1’ 的最大正方形,并返回其面积。
示例1
输入:matrix = [["1","0","1","0","0"],["1","0","1","1","1"],["1","1","1","1","1"],["1","0","0","1","0"]]
输出:4
示例2
输入:matrix = [["0","1"],["1","0"]]
输出:1
示例3
输入:matrix = [["0"]]
输出:0
提示
- m == matrix.length
- n == matrix[i].length
- 1 <= m, n <= 300
matrix[i][j]
为 ‘0’ 或 ‘1’
解法
设置二维数组 dp[i][j]
表示以i,j为正方形右下角的最大正方形边长,其最长边长与dp[i-1][j],dp[i][j-1],dp[i-1][j-1]
相关(将其表示为c1,c2,c3),取其最小边长+1更新,即
m
a
t
r
i
x
[
i
]
[
j
]
=
m
i
n
(
c
1
,
c
2
,
c
3
)
+
1
matrix[i][j] = min(c1,c2,c3)+1
matrix[i][j]=min(c1,c2,c3)+1
class Solution:
def maximalSquare(self, matrix: List[List[str]]) -> int:
m, n, result = len(matrix), len(matrix[0]), 0
for i in range(m):
for j in range(n):
matrix[i][j] = int(matrix[i][j])
c1 = matrix[i-1][j] if i>0 else 0
c2 = matrix[i][j-1] if j>0 else 0
c3 = matrix[i-1][j-1] if j>0 and i>0 else 0
if matrix[i][j]:
matrix[i][j] = min(c1,c2,c3)+1 # min(min(c2, c3), min(c1,c3))+1
result = max(result, matrix[i][j])
return result**2
- 时间复杂度 O ( n 2 ) O(n^2) O(n2)
- 空间复杂度 O ( n 2 ) O(n^2) O(n2)
一开始想复杂了,使用通用的最大长方形的方式实现最大正方形
在求解最大长方形时需要利用到动态规划+单调栈
求解最大正方形直接使用动态规划即可
在此也贴上使用动态规划+单调栈方式实现最大正方形的代码好了
class Solution:
def maximalSquare(self, matrix: List[List[str]]) -> int:
m, n, result = len(matrix), len(matrix[0]), 0
for i in range(m):
for j in range(n):
matrix[i][j] = int(matrix[i][j])
if j>0 and matrix[i][j]:matrix[i][j] += matrix[i][j-1]
matrix.append([-1 for _ in range(n)])
m, stack = m+1, []
for j in range(n):
for i in range(m):
while stack and matrix[stack[-1]][j] > matrix[i][j]:
cur = stack.pop()
left = stack[-1] if stack else -1
result = max(result, min(matrix[cur][j],i-left-1)) #取边长最小
stack.append(i)
stack.pop()
return result**2