LeetCode 85 - Maximal Rectangle

原题：
Given a 2D binary matrix filled with 0’s and 1’s, find the largest rectangle 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: 6

大致题意：
给一个3D的只有1和0的矩阵，求矩阵中只包含1的最大矩阵的面积。

---

使用dp+单调栈的思路，先用dp数组对每一行的进行遍历，存储每个位置从下往上数有多少个连续的1，如果当前位置是0则直接为0。然后遍历完一行，通过类似直方图中求最大矩形的方法（具体算法有个英文名字，给忘了。。）可以遍历一遍列就得到这一行中最大矩形面积。因为会按行遍历，然后每次遍历再按列遍历，最后时间复杂度是O(nm)，空间复杂度是O(m)。

class Solution {
public:
    int maximalRectangle(vector<vector<char>>& matrix) {
        if (matrix.size() == 0 || matrix[0].size() == 0) return 0;
        int n = matrix.size(), m = matrix[0].size();
        vector<int> dp(m, 0);
        int ans = 0;
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; j++) {
                if (matrix[i][j] == '1') {
                    dp[j]++;
                } else {
                    dp[j] = 0;
                }
            }
            int cur = maxRectanglePerRow(dp);
            ans = max(ans, cur);
        }
        return ans;
    }

    int maxRectanglePerRow(vector<int>& row) {
        if (row.size() == 0) return 0;
        row.push_back(-1);
        int ans = 0;
        vector<int> s;
        for (int i = 0; i < row.size(); i++) {
            while (s.size() && row[s.back()] > row[i]) {
                int cur = s.back();
                s.pop_back();
                if (s.size()) {
                    ans = max(ans, row[cur] * (i - s.back() - 1));
                } else {
                    ans = max(ans, row[cur] * i);
                }
            }
            s.push_back(i);
        }
        row.pop_back();
        return ans;
    }
};

原题链接：https://leetcode.com/submissions/detail/149892295/

这个应该还有更优化的方法，但是单调栈应该是比较容易想到的