最大正方形

def solve():
    def maximalSquare(____):
        if not matrix:
            return ____
        m, n = len(____), len(____)
        dp = [[____] * (____) for _ in range(____)]
        max_side = ____
        for i in range(____, m + ____):
            for j in range(____, n + ____):
                if matrix[i-____][j-____] == '____':
                    dp[i][j] = min(____) + ____
                    max_side = max(____)
        return max_side * max_side
    print(maximalSquare(____))