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

문제출처

function solution(board)
{
    let answer = 0;
    
    if (board.length === 1 || board[0].length === 1) return 1;

    for (let i=1; i<board.length; i++) {
        for (let j=1; j<board[0].length; j++) {
            if (board[i][j] > 0) {
                const min = Math.min(board[i-1][j], board[i][j-1], board[i-1][j-1]);
                board[i][j] = min + 1;
            }
            if (answer < board[i][j]) answer = board[i][j];
        }
    }
    
    return answer ** 2;
}