最大正方形-动态规划221-python

python

class Solution:
    def maximalSquare(self, matrix: List[List[str]]):
        res = 0
        m = len(matrix) # raw
        n = len(matrix[0]) # column
        dp = [[0] * n for _ in range(m)]

        for i in range(m):
            if matrix[i][0] == '1':
                dp[i][0] = 1
                res = 1
        for j in range(n):
            if matrix[0][j] == '1':
                dp[0][j] = 1
                res = 1

        for i in range(1, m):
            for j in range(1, n):
                if matrix[i][j] == '1':
                    dp[i][j] = min(dp[i-1][j], dp[i-1][j-1], dp[i][j-1]) + 1
                    res = max(res, pow(dp[i][j], 2))
        
        return res