221. Maximal Square

https://leetcode.com/problems/maximal-square/description/

最开始想的是：用f[i][j][side_len_i][side_len_j]来表示以[i, j]为左上顶点，高为side_len_i, 宽为side_len_j的矩形。
最后解法如下（TLE）：
···
public class Solution {
public int maximalSquare(char[][] matrix) {
if (matrix.length == 0 || matrix[0].length == 0)
return 0;
boolean f[][][][] = new boolean[matrix.length][matrix[0].length][matrix.length + 1][matrix[0].length + 1];
for (int i = 0; i < matrix.length; i ++){
for (int j = 0; j < matrix[i].length; j ++){
for (int k = 0; k + i <= matrix.length; k ++){
f[i][j][k][0] = true;
}
for (int k = 0; k + j <= matrix[0].length; k ++){
f[i][j][0][k] = true;
}
}
}

    for (int i = 0; i < matrix.length; i ++){
        for (int j = 0; j < matrix[i].length; j ++){
            for (int sideLenI = 1; sideLenI + i <= matrix.length; sideLenI ++){
                for (int sideLenJ = 1; sideLenJ + j <= matrix[i].length; sideLenJ ++){
                    //System.out.println(f[i][j][sideLenI - 1][sideLenJ]);
                    //System.out.println(f[i][j][sideLenI][sideLenJ-1]);
                    //System.out.println(matrix[i + sideLenI - 1][j + sideLenJ - 1]);
                    f[i][j][sideLenI][sideLenJ] = (f[i][j][sideLenI - 1][sideLenJ] == true && f[i][j][sideLenI][sideLenJ-1]== true && matrix[i + sideLenI - 1][j + sideLenJ - 1] == '1');
                }
            }
        }
    }
    //System.out.println(f[0][0][1][1]);

    int max_len = 0;
    for (int i = 0; i < matrix.length; i ++){
        for (int j = 0; j < matrix[0].length; j ++){
            for (int side_len = 0; side_len + i <= matrix.length && side_len + j <= matrix[0].length; side_len ++){
                if (f[i][j][side_len][side_len] == true && side_len > max_len){
                    max_len = side_len;
                }
            }
        }
    }
    return max_len * max_len;
}

}
···

后来想出来，可以用另一种状态表示(final solution)：
f[i][j][side_len] = f[i][j][side_len - 1] && f[i + 1][j][side_len - 1] && f[i][j + 1][side_len - 1] && matrix[i + side_len - 1][j + side_len - 1] == ‘1’;

public class Solution {
    public int maximalSquare(char[][] matrix) {
        if (matrix.length == 0 || matrix[0].length == 0)
            return 0;
        boolean f[][][] = new boolean[matrix.length][matrix[0].length][(matrix.length > matrix[0].length ? matrix[0].length : matrix.length) + 1];

        int max_len = 0;
        for (int i = 0; i < matrix.length; i ++){
            for (int j = 0; j < matrix[0].length; j ++){
                f[i][j][1] = (matrix[i][j] == '1');
                if (f[i][j][1] == true){
                    max_len = 1;
                }
            }
        }

        for (int side_len = 2; side_len <= matrix.length && side_len <= matrix[0].length; side_len ++){
            for (int i = 0; i + side_len <= matrix.length; i ++){
                for (int j = 0; j + side_len <= matrix[0].length; j ++){
                    f[i][j][side_len] = f[i][j][side_len - 1] && f[i + 1][j][side_len - 1] && f[i][j + 1][side_len - 1] && matrix[i + side_len - 1][j + side_len - 1] == '1';
                    if (f[i][j][side_len] == true && side_len > max_len){
                        max_len = side_len;
                    }
                }
            }
        }


        return max_len * max_len;
    }
}