矩阵中的最大面积-算法题

最大矩阵

题意：给出一个矩阵，由‘0’和‘1’组成，求由‘1’组成的最大矩形的面积。
传送门

输入：matrix = [[“1”,“0”,“1”,“0”,“0”],[“1”,“0”,“1”,“1”,“1”],[“1”,“1”,“1”,“1”,“1”],[“1”,“0”,“0”,“1”,“0”]]
输出：6
解释：最大矩形如上图所示。

输入：matrix = [[“0”]]
输出：0

先通过dp预处理每一列（行）的最大长度，然后再暴力枚举宽即可：

// O(nm^2)
int maximalRectangle(vector<vector<char>>& matrix) {
    int n = matrix.size(), m = matrix[0].size();
    vector<vector<int>> v(n, vector<int>(m));
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < m; ++j) {
            if (matrix[i][j] == '0') continue;
            if (!i) v[i][j] = (matrix[i][j] == '1');
            else v[i][j] = v[i-1][j] + 1;
        }
    }
    int ret = 0;
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < m; ++j) {
            int a = 0, b = INT_MAX;
            for (int k = j; k >= 0; --k) {
                a += 1;
                b = min(b, v[i][k]);
                ret = max(ret, a*b);
            }
        }
    }
    return ret;
}

优化：通过dp处理完，本质上是每一行形成了一堆柱状图，选取其中最大的面积，类似于【传送门】这道题，所以可以通过单调栈做一个优化，实现O(nm)的时间复杂度：

int maximalRectangle(vector<vector<char>>& matrix) {
    int n = matrix.size(), m = matrix[0].size();
    vector<vector<int>> dp(n, vector<int>(m));
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < m; ++j) {
            if (matrix[i][j] == '0') continue;
            if (!i) dp[i][j] = (matrix[i][j] == '1');
            else dp[i][j] = dp[i-1][j] + 1;
        }
    }
    int ret = 0;
    stack<int> id;
    vector<int> left(m, -1), right(m, m);
    for (int i = 0; i < n; ++i) {
        left.assign(m, -1);
        right.assign(m, m);
        id = stack<int>();
        for (int j = 0; j < m; ++j) {
            while (id.size() && dp[i][id.top()] >= dp[i][j]) {
                right[id.top()] = j;
                id.pop();
            }
            if (id.size()) left[j] = id.top();
            id.push(j);
        }
        for (int j = 0; j < m; ++j) {
            ret = max(ret, (right[j]-left[j]-1) * dp[i][j]);
        }
    }
    return ret;
}

最大正方形

题意：同上，求最大正方形面积；
传送门

int maximalSquare(vector<vector<char>>& matrix) {
    int n = matrix.size(), m = matrix[0].size(), ret = 0;
    vector<vector<int>> dp(n, vector<int>(m));
    for (int i = 0; i < n; ++i) 
        for (int j = 0; j < m; ++j)
            dp[i][j] = matrix[i][j]-'0';
    for (int i = 1; i < n; ++i)
        for (int j = 1; j < m; ++j)
            if (dp[i][j])
                dp[i][j] = min(min(dp[i-1][j-1], dp[i-1][j]), dp[i][j-1]) + 1;
    for (int i = 0; i < n; ++i) 
        for (int j = 0; j < m; ++j)
            ret = max(ret, dp[i][j]); 
    return ret*ret;
}