Java DP simple solution


  • 5
    P
    public class Solution {
        public int maximalSquare(char[][] matrix) {
            if (matrix == null || matrix.length == 0) return 0;
            
            int row = matrix.length;
            int col = matrix[0].length;
            int max = 0;
            
            // matrix to  keep track the size of a square which its bottom right corner is i,j
            int S[][] = new int[row][col];
            for (int i = 0; i < row; i++){
                for (int j = 0; j < col; j++){
                    if (i == 0 || j == 0) S[i][j] = matrix[i][j] - '0';
                    else if (matrix[i][j] == '0') S[i][j] = 0;
                    else {
                        S[i][j] = Math.min(S[i][j-1], Math.min(S[i-1][j], S[i-1][j-1])) + 1;
                    }
                    
                    //replace the largest square if necessary
                    if (max < S[i][j]) max = S[i][j];
                }
            }
            return max*max;
        }
    }

Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.