230419 가장 큰 정사각형 찾기

int[][] dp = new int[board.length + 1][board[0].length + 1];

int maxLength = 0;
for (int i = 1; i <= board.length; i++) {
    for (int j = 1; j <= board[0].length; j++) {
        if (board[i - 1][j - 1] == 0)
            continue;
        int min = Math.min(Math.min(dp[i - 1][j], dp[i][j - 1]), dp[i - 1][j - 1]);
        dp[i][j] = min + 1;
        maxLength = Math.max(maxLength, min + 1);
    }
}
return maxLength * maxLength;

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