[프로그래머스] lv.2 가장 큰 정사각형 python

https://school.programmers.co.kr/learn/courses/30/lessons/12905

프로그래머스

 

def solution(board):
    n=len(board)
    dp = [[0] * len(board[0]) for _ in range(n)]
    dp[0] = board[0]
    for i in range(1, n):
        dp[i][0] = board[i][0]
    
    for i in range(1, n):
        for j in range(1, len(board[0])):
            if board[i][j] == 1:
                dp[i][j] = min(dp[i-1][j-1], dp[i-1][j], dp[i][j-1]) + 1
    m=[]
    for i in range(n):
        m.append(max(dp[i]))
    
    answer=max(m)**2
    return answer