最大矩形

57 篇文章 0 订阅

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

示例:

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

 

class Solution:
    def maximalRectangle(self, matrix):
        """
        :type matrix: List[List[str]]
        :rtype: int
        """
        # m行, n列
        if matrix and matrix[0]:
            m, n = len(matrix), len(matrix[0])
        else:
            return 0
        mx = 0
        for i in range(m):
            if i == 0:
                heights = [int(ele) for ele in matrix[i]]
                # mx = self.func(heights) if self.func(heights) > mx else mx
                temp = self.func(heights)
                mx = temp if temp > mx else mx
                print('i is {}, heights is {}, mx is {}'.format(i, heights, mx))
            else:
                for j in range(n):
                    if matrix[i][j] == '1':
                        heights[j] += int(matrix[i][j])
                    else:
                        heights[j] = 0
                # mx = self.func(heights) if self.func(heights) > mx else mx
                temp = self.func(heights)
                mx = temp if temp > mx else mx
                print('i is {}, heights is {}, mx is {}'.format(i, heights, mx))
        return mx
                    
    def func(self, heights):
        temp = []
        stack = []
        heights.append(-1)
        for ind, height in enumerate(heights):
            cpos = ind
            while stack and stack[-1][-1] >= height:
                cpos, h = stack.pop()
                temp.append((ind - cpos) * h)
            stack.append([cpos, height])
        return max(temp) if temp else 0
                

 

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值