[leetCode] Maximal Square

Given a 2D binary matrix filled with 0's and 1's, find the largest square containing all 1's and return its area.

For example, given the following matrix:

1 0 1 0 0
1 0 1 1 1
1 1 1 1 1
1 0 0 1 0

Return 4.

public class Solution {
    public int maximalSquare(char[][] matrix) {
        if (matrix.length == 0 || matrix[0].length == 0) return 0;

        int res = 0;

        int[][] m = new int[matrix.length][matrix[0].length];

        for (int i = 0; i < matrix[0].length; i++) {
            if (matrix[0][i] == '1') {
                m[0][i] = 1;
                res = 1;
            }
        }

        for (int i = 1; i < matrix.length; i++) {
            for (int j = 0; j < matrix[0].length; j++) {
                m[i][j] = matrix[i][j] - '0';

                if (m[i-1][j] != 0 && m[i][j] != 0) {
                    m[i][j] += m[i-1][j];
                }
                if (m[i][j] != 0) {
                    for (int k = 0; k < m[i][j]; k++) {
                        if (j - k >= 0) {
                            boolean flag = true;
                            for (int ii = j-k; ii <= j; ii++) {
                                if (m[i][ii] <= k) flag = false;
                            }
                            if (flag == true) {
                                res = res > (k+1) * (k+1) ? res : (k+1) * (k+1);
                            }
                            else break;
                        }
                    }
                }
            }
        }
        return res;
    }
}