leetcode 85 最大矩形
z

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

示例:

1
2
3
4
5
6
7
8
输入:
[
["1","0","1","0","0"],
["1","0","1","1","1"],
["1","1","1","1","1"],
["1","0","0","1","0"]
]
输出: 6

  • 维护一个数组h,保存每一层到现在的状态,那么就可以转换为到在每个状态的最大值得情况
  • 等价于在一个数组中,找到最大的矩形
1