85. Maximal Rectangle

最新推荐文章于 2021-10-17 09:55:57 发布

是三水不是泗水

最新推荐文章于 2021-10-17 09:55:57 发布

阅读量85

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/csg3140100993/article/details/103118378

版权

LeetCode 专栏收录该内容

56 篇文章 0 订阅

订阅专栏

85. Maximal Rectangle

Hard

188155FavoriteShare

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

Accepted

142,515

Submissions

405,728

class Solution {
public:
    int maximalRectangle(vector<vector<char>>& matrix) {
    	if(matrix.size()==0) return 0;
        vector<int> height;
        height.resize(matrix[0].size());
        int row=matrix.size();
        int col=matrix[0].size();
        int res=0;
        for(int i=0;i<row;i++){
        	for(int j=0;j<col;j++){
        		height[j]=matrix[i][j]=='0'?0:(height[j]+1);
        	}
        	res=max(res,computehistogram(height));
        }
        return res;
    }
    int computehistogram(vector<int>& height){
    	int res=0;
    	for(int i=0;i<height.size();i++){
    		if(i+1<height.size()&&(height[i]<=height[i+1])){//这里两个判断位置不能变否则出错
    			continue;
    		}
    		int minH = height[i];//找到一个局部峰值
            for (int j = i; j >= 0; --j) {
                minH = min(minH, height[j]);
                int area = minH * (i - j + 1);//从当前位置往前依次计算可组成的矩形面积
                res = max(res, area);
            }
    	}
    	return res;
    }
};