问题:给定一个全是0或1的网格,求一块全由1组成的最大的正方形的面积
例:
A = [[0,1,1,1,0],
[0,1,1,1,1],
[1,1,1,1,0],
[0,0,1,0,0]]
输出:9(边长是3)
设:f[i][j]是以A[i][j]为右下角的最大的全1正方形的边长
f[i][j] = 0 if A[i][j] = 0
1 if A[i][j] = 1 and (i==0 or j==0) (边界,第一行或第一列)
min(f[i-1][j]+1,f[i][j-1]+1,f[i-1][j-1]+1) if A[i][j] = 1
时间复杂度是O(n,m),空间复杂度O(m*n)
代码及注释如下:
def max_square(A):
if len(A) == 0 or len(A[0]) == 0:
return 0
#m,n是A的行和列
m , n = len(A) , len(A[0])
res = 0
f = [[0 for i in range(n)] for j in range(m)]
for i in range(m):
for j in range(n):
if A[i][j] == 0:
continue
if i == 0 or j == 0:
f[i][j] = 1
continue
f[i][j] = min(f[i-1][j]+1,f[i][j-1]+1,f[i-1][j-1]+1)
res = max(res,f[i][j]*f[i][j])
return res
A = [[0,1,1,1,0],
[0,1,1,1,1],
[1,1,1,1,0],
[0,0,1,0,0]]
print(max_square(A))
#输出:9