[프로그래머스] 가장 큰 정사각형

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

프로그래머스

 

---

[풀이] 

 

 

 

 

 

 

 

 

 

 

---

[코드 - python3]

 

from copy import deepcopy
def solution(board):
    row=len(board)
    col=len(board[0])
    answer=max(board[0])
    dp=deepcopy(board)
    for r in range(1,row):
        for c in range(1, col):
            if board[r][c]==1:
                if board[r-1][c-1]==1 and board[r-1][c]==1 and board[r][c-1]==1:
                    dp[r][c]= min(dp[r-1][c-1], dp[r-1][c], dp[r][c-1])+1
                    answer=max(answer, dp[r][c])
    
    return answer**2