链接:https://leetcode-cn.com/problems/maximal-rectangle
给定一个仅包含 0
和 1
的二维二进制矩阵,找出只包含 1
的最大矩形,并返回其面积。
示例:
输入:
[
["1","0","1","0","0"],
["1","0","1","1","1"],
["1","1","1","1","1"],
["1","0","0","1","0"]
]
输出:6
思路:接着第 85 题做。
链接:https://leetcode-cn.com/problems/maximal-rectangle
给定一个仅包含 0
和 1
的二维二进制矩阵,找出只包含 1
的最大矩形,并返回其面积。
示例:
输入:
[
["1","0","1","0","0"],
["1","0","1","1","1"],
["1","1","1","1","1"],
["1","0","0","1","0"]
]
输出:6
思路:接着第 85 题做。