LeetCode 85. 最大矩形 (单调栈)

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

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/maximal-rectangle
著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。

Solution

利用84题的思路，求出每一层的 heights[] 然后传给上一题的函数就可以了。

class Solution:
    def maximalRectangle(self, matrix: List[List[str]]) -> int:
        if