【LeetCode】85. 最大矩形结题报告 (C++)

置顶

暮雨凉初透

于 2018-09-02 11:09:38 发布

阅读量480

点赞数

CC 4.0 BY-SA版权

本文链接：https://blog.csdn.net/qq_32805671/article/details/82313504

原题地址：https://leetcode-cn.com/problems/maximal-rectangle/description/

题目描述：

给定一个仅包含 0 和 1 的二维二进制矩阵，找出只包含 1 的最大矩形，并返回其面积。

示例:

输入:
[
["1","0","1","0","0"],
["1","0","1","1","1"],
["1","1","1","1","1"],
["1","0","0","1","0"]
]
输出: 6

解题方案：

参考链接：https://blog.csdn.net/LaputaFallen/article/details/79869806 该链接包含正方形矩阵和矩形矩阵的解题思路，本题是矩形矩阵更难一些。运用到了动态规划，现在就还没完全搞明白这道题的解题方式。。。留着以后再学习。

class Solution {
public:
    int maximalRectangle(vector<vector<char>>& matrix) {
        if(matrix.empty()) return 0;
        int m = matrix.size();
        int n = matrix[0].size();
        int left[n], right[n], height[n];
        fill_n(left, n, 0); 
        fill_n(rig