给定一个仅包含 0 和 1 的二维二进制矩阵,找出只包含 1 的最大矩形,并返回其面积。
示例:
输入:
[
["1","0","1","0","0"],
["1","0","1","1","1"],
["1","1","1","1","1"],
["1","0","0","1","0"]
]
输出: 6
把每一层看作是柱状图,对每一行求一个高度,这个高度就是对应的连续1的长度,对每一行就柱状图的最大面积
求柱状图的最大面积用单调栈,https://www.cnblogs.com/lichen782/p/leetcode_Largest_Rectangle_in_Histogram.html
class Solution {
private:
int largeRecArea(vector<int> heights)
{
heights.insert(heights.begin(), 0);
heights.push_back(0);
int res = 0;
stack<int> stk;
for(int i = 0;i < heights.size();i++)
{
while(!stk.empty() && heights[i] < heights[stk.top()])
{
int top = stk.top();
stk.pop();
res = max(res, heights[top] * (i - stk.top() - 1));
}
stk.push(i);
}
return res;
}
public:
int maximalRectangle(vector<vector<char>>& matrix) {
if(matrix.empty()) return 0;
vector<int> heights(matrix[0].size());
int ans = 0;
for(int i = 0;i < matrix.size(); i++)
{
//对每一行求高度
for(int j = 0;j < matrix[0].size(); j++)
{
if(matrix[i][j] == '1') heights[j]++;
else heights[j] = 0;
}
ans = max(ans, largeRecArea(heights));
}
return ans;
}
};