Leetcode 85. 最大矩形
题目
给定一个仅包含 0 和 1 的二维二进制矩阵,找出只包含 1 的最大矩形,并返回其面积。
测试样例
输入:
[
["1","0","1","0","0"],
["1","0","1","1","1"],
["1","1","1","1","1"],
["1","0","0","1","0"]
]
输出: 6
题解
此题可以用到84题的方法,我们以每行为x轴,因此转化成84题中求最大矩形的问题,而求每行中对应的每列的1的高度,我们可以用转移方程实现。
令heights[i][j]为第i行作为x轴时,第j列的连续1的高度,
- 若matrix[i][j]==1,则heights[i][j] = height[i-1][j]+1
- 若matrix[i][j]==0,则heights[i][j] = 0
详细过程见代码
代码
int area(vector<int> &heights){
stack<int> index;
index.push(-1);
int i,j,n=heights.size(),ans=0,now;
for(i=0; i<n; i++){
if(index.top()!=-1 && heights[index.top()]>=heights[i]){
j = index.top();
while(j!=-1 && heights[j]>=heights[i]){
index.pop();
now = heights[j]*(i-index.top()-1);
if(ans < now){
ans = now;
}
j = index.top();
}
}
index.push(i);
}
while(index.top()!=-1){
j = index.top();
index.pop();
now = heights[j]*(n-index.top()-1);
if(now > ans) ans = now;
}
return ans;
}
int maximalRectangle(vector<vector<char>>& matrix) {
if(matrix.empty() || matrix[0].empty()) return 0;
int i,j,m=matrix.size(),n=matrix[0].size();
vector<vector<int>> heights(m,vector<int>(n,0));
for(j=0; j<n; j++){
heights[0][j] = matrix[0][j]-'0';
}
for(i=1; i<m; i++){
for(j=0; j<n; j++){
if(matrix[i][j] == '0') heights[i][j] = 0;
else heights[i][j] = heights[i-1][j]+1;
}
}
int ans=0;
for(i=0; i<m; i++){ //每一行充当x轴,转化为84题的问题
ans = max(ans,area(heights[i]));
}
return ans;
}
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/maximal-rectangle
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。