【力扣221. 最大正方形】dp(python3)

题目描述

https://leetcode-cn.com/problems/maximal-square/

思路题解

哎，又跪了一道dp，不想说啥了。直接看题解吧
https://leetcode-cn.com/problems/maximal-square/solution/zui-da-zheng-fang-xing-by-leetcode-solution/

我的一开始的思路：
dp[i][j][k]=dp[i//2][j//2][k//2] and dp[i//2][j][k//2] and dp[i][j//2][k//2] and dp[i][j][k//2]
后来想起来k为奇数就gg。遂放弃。

class Solution:
    def maximalSquare(self, matrix: List[List[str]]) -> int:
        m,n=len(matrix),len(matrix[0])
        h=min(m,n)
        dp=[[[True for k in range(h)] for j in range(n)]for i in range(m)]
        print(len(dp),len(dp[0]),len(dp[0][0]))
        for i in range(m):
            for j in range(n):
                dp[i][j][1] = False if matrix[i][j]=="0" else True
        for k in range(2,h+1):
            if k%2==1:
                
            for i in range(k-1,m):
                for j in range(k-1,n):
                    print(k,i,j,k//2,i//2,j//2)
                    dp[i][j][k]=dp[i//2][j//2][k//2] and dp[i//2][j][k//2] and dp[i][j//2][k//2] and dp[i][j][k//2]
        for i in range(m):
            for j in range(n):
                print(dp[i][j][2],end="")
            print()

正确的代码：

class Solution:
    def maximalSquare(self, matrix: List[List[str]]) -> int:
        ans=0
        dp=[[0 for j in range(len(matrix[0]))]for i in range(len(matrix))]
        for i in range(0,len(matrix)):
            for j in range(0,len(matrix[0])):
                if matrix[i][j]=="1":
                    dp[i][j]=1+min(dp[i-1][j-1],dp[i-1][j],dp[i][j-1]) if i>0 and j>0 else 1
                    ans=max(ans,dp[i][j])
        return ans**2