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.

可以用前面柱状图的解法，比较复杂。

class Solution {
public:
    int maximalSquare(vector<vector<char>>& matrix) {
        if (matrix.empty() || matrix[0].empty()) {
            return 0;
        }
        
        int maxSquare = 0;
        vector<int> sums(matrix[0].size(), 0);
        for (int i = 0; i < matrix.size(); ++i) {
            for (int j = 0; j < matrix[i].size(); ++j) {
                if (matrix[i][j] == '0') {
                    sums[j] = 0;
                }
                else {
                    ++sums[j];
                }
            }
            maxSquare = max(maxSquare, findMaxSquare(sums));
        }
        
        return maxSquare;
    }
    
    int findMaxSquare(const vector<int>& nums) {
        int maxSquare = 0;
        stack<int> cols;
        int i = 0;
        for (; i < nums.size(); ++i) {
            while (!cols.empty() && nums[i] < nums[cols.top()]) {
                int hight = nums[cols.top()];
                cols.pop();
                int len = cols.empty() ? i : i - cols.top() - 1;
                len = min(len, hight);
                maxSquare = max(maxSquare, len * len);
            }
            cols.push(i);
        }
        
        while (!cols.empty()) {
            int hight = nums[cols.top()];
            cols.pop();
            int len = cols.empty() ? i : i - cols.top() - 1;
            len = min(len, hight);
            maxSquare = max(maxSquare, len * len);
        }
        
        return maxSquare;
    }
};

也可以DP，不过不太好想到状态转移方程。这里跟踪最大面积的右下角坐标，记录以它为标的的连续1的个数。如果当前值为1，那么它等于它左边点，上边点，左上方点中取值最小的，再加上自身的1。根据这三个方向简单的反向推导，沿着左上方平移，可以覆盖整个正方形。

class Solution {
public:
    int maximalSquare(vector<vector<char>>& matrix) {
        if (matrix.empty() || matrix[0].empty()) {
            return 0;
        }
        
        int maxLen = 0;
        vector<vector<int>> lens(matrix.size(), vector<int>(matrix[0].size(), 0));
        for (int i = 0; i < matrix.size(); ++i) {
            for (int j = 0; j < matrix[0].size(); ++j) {
                if (matrix[i][j] == '0') {
                    lens[i][j] = 0;
                }
                else if (i == 0 || j == 0) {
                    lens[i][j] = 1;
                }
                else {
                    lens[i][j] = min(min(lens[i][j-1], lens[i-1][j]), lens[i-1][j-1]) + 1;
                }
                maxLen = max(maxLen, lens[i][j]);
            }
        }
        
        return maxLen * maxLen;
    }
};