LeetCode.221 Maximal Square（最大正方形面积）

题目

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

Example:
Input: 

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

Output: 4

分析

	class Solution {
    public int maximalSquare(char[][] matrix) {
        // 思路：采用对称轴取不同len的长度进行比较，判断是否在len相同的横轴、纵轴均为1，否则i和j分别从i+len、j+len的长度开始取,最后的结果就是len的平方
        if (matrix == null || matrix.length == 0 || matrix[0].length == 0) {
            return 0;
        }

        int resLen = 0;
        int colLength=matrix[0].length;
        int rowLength=matrix.length;

        int tempLen = 1;
        for (int i = 0; i < rowLength; i ++) {
            for (int j = 0; j < colLength; j++) {
                tempLen = 1;
                if (matrix[i][j] == '1') {
                    // 赋值新的tempLen
                    tempLen = recursion(i, j, matrix, tempLen);
                    resLen = Math.max(resLen, tempLen);
                }
            }
        }
        return resLen * resLen;
    }
     public int recursion(int indexX, int indexY, char[][] matrix, int tempLen) {
        if (indexX + tempLen < matrix.length && indexY + tempLen < matrix[0].length) {
            for (int i = indexX; i <= indexX + tempLen; i++) {
                if (matrix[i][indexY + tempLen] != '1') {
                    return tempLen;
                }
            }
            
            for (int j = indexY; j <= indexY + tempLen; j++) {
                if (matrix[indexX + tempLen][j] != '1') {
                    return tempLen;
                }
            }
            
            // 说明均为1，步长增加1
            tempLen++;
            return recursion(indexX, indexY, matrix, tempLen);
        }
        return tempLen;
    }
}

结果

Runtime: 3 ms, faster than 99.72% of Java online submissions for Maximal Square.
Memory Usage: 43.9 MB, less than 55.88% of Java online submissions for Maximal Square.
Next challenges: