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

思路：可借鉴84题的柱形图最大矩形面积的求解过程，分别计算0 ~ n(n= 0,1,2...row)层之间的矩形面积。

class Solution {
public:
    int maximalRectangle(vector<vector<char>>& matrix) {
        if(!matrix.size()) return 0;
        vector<int> vec(matrix[0].size(),0);
        int maxcount =0;
        
        for(int i=0; i< matrix.size();i++){
            for(int j=0; j<matrix[0].size();j++){
                vec[j] = matrix[i][j] =='1'? vec[j]+1:0; //置0，因为上一层已经计算，避免重复计算
            }
            //分别计算0~i层的最大矩形面积
            maxcount = max(maxcount,maxRectangleArea(vec) );
        }
        return maxcount;
    }

private:
    //84.柱状图中最大的矩形 的代码，
    //用于找到nums中完整包含当前高度的最长宽度
    int maxRectangleArea(vector<int> &nums)
    {
        stack<int> s;//单调栈
        nums.push_back(0);//设置一个哨兵，让nums遍历到最后时，获得的柱体高度可让单调栈前面的所有元素出栈
        int maxArea = 0;
        for(int i=0;i<nums.size();++i)
        {
            while(!s.empty() && nums[i]<=nums[s.top()])
            {
                int top = s.top();s.pop();
                maxArea = max(maxArea,nums[top]*(s.empty()?i:i-s.top()-1));
            }
            s.push(i);
        }
        nums.pop_back();
        return maxArea;
    }

};