85. 最大矩形/C++

class Solution {
public:
	//leetcode84
    int largestRectangleArea(vector<int> heights) {
	     heights.push_back(0);
	     stack<int> stk;
	     int maxArea = 0;
	     for(int i = 0;i<heights.size();i++)
	     {
	         while(!stk.empty() && heights[i]<heights[stk.top()])
	         {
	             int top= stk.top();
	             stk.pop();
	             maxArea = max(maxArea,heights[top]*(stk.empty()? i:(i - stk.top() -1)));
	         }
	         stk.push(i);
	     }
	     return maxArea;
    }
    int maximalRectangle(vector<vector<char>>& matrix) {
        if(matrix.empty() || matrix[0].empty()) return 0;
        int maxArea = 0;
        vector<int> dp(matrix[0].size());
        
        for(int i=0;i<matrix.size();++i){
            for(int j=0;j<matrix[0].size();++j){
                dp[j]= matrix[i][j] == '1' ? dp[j] + 1 : 0;
            }
            maxArea = max(maxArea,largestRectangleArea(dp));
        }
        return maxArea;
    }
};