Python DP


  • 0
    class Solution(object):
        def maximalSquare(self, matrix):
            """
            :type matrix: List[List[str]]
            :rtype: int
            """
            m = len(matrix)
            n = len(matrix[0]) if m else 0
            maxn = 0
            f = [[0] * (n+1) for _ in range(m+1)]
            for i in range(1,m+1):
                for j in range(1,n+1):
                    if matrix[i-1][j-1] == '1':
                        f[i][j] = 1 + min(f[i-1][j], f[i][j-1], f[i-1][j-1])
                        maxn = max(maxn, f[i][j])
            return maxn**2

Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.