Leetcode 85. Maximal Rectangle

最新推荐文章于 2021-06-14 17:39:06 发布

小白菜又菜

最新推荐文章于 2021-06-14 17:39:06 发布

阅读量132

点赞数

分类专栏：解题报告动态规划（DP）

本文链接：https://blog.csdn.net/mobius_strip/article/details/112004730

版权

解题报告同时被 2 个专栏收录

1369 篇文章 4 订阅

订阅专栏

动态规划（DP）

212 篇文章 3 订阅

订阅专栏

这篇博客介绍了如何使用动态规划和单调队列解决二维矩阵中找到最大全1矩形的问题。首先进行预处理，计算每行从底部开始的最大连续1的高度。接着，利用单调队列在每一层的底部找到最大的矩形。最终，通过遍历每一层，结合单调队列找到全局的最大矩形面积，时间复杂度为O(N^2)。

摘要由CSDN通过智能技术生成

Problem

Given a rows x cols binary matrix filled with 0’s and 1’s, find the largest rectangle containing only 1’s and return its area.

Algorithm

Dynamic Programming (DP). The same problem as Leetcode 84.
We decompose the problem into the largest rectangle, that is, solve the largest rectangle in the graph whose bottom side is k, and then merge to find the largest rectangle.
Preprocessing: Calculate the maximum continuous 1 height MaxH from the bottom of each row of the bottom of each row. $O(N^2)$
DP: For the bottom side of each layer, we use a monotonic queue to find the largest rectangle of the row. $O (N)$
For the solution analysis of monotonic queue, please refer to the solution of Leetcode 84.
Overall time cost: $T(N) = O(N^2)+O(N)*O(N) = O(N^2)$ .

Code

class Solution:
    def maximalRectangle(self, matrix: List[List[str]]) -> int:
        if not matrix:
            return 0
        
        rows = len(matrix)
        cols = len(matrix[0])
        Maps = [[0] * (cols + 2) for i in range(rows + 2)]
        for i in range(rows):
            for j in range(cols):
                Maps[i+1][j+1] = matrix[i][j]
		
        MaxH = Maps.copy()
        for i in range(rows):
            for j in range(cols):
                if Maps[i+1][j+1] == '1':
                    MaxH[i+1][j+1] = MaxH[i][j+1] + 1  
                else:
                    MaxH[i+1][j+1] = 0
              
        for i in range(rows): 
            MaxH[i+1][0] = MaxH[i+1][cols+1] = -1
        
        MaxV = 0
        MUQ = [0] * (cols + 2)
        L = [0] * (cols + 2)
        R = [0] * (cols + 2)
        for i in range(1, rows+1, 1):  
            tail = 0
            MUQ[0] = 0
            for j in range (1, cols+2, 1):  
                while tail >= 0 and MaxH[i][MUQ[tail]] > MaxH[i][j]:
                    R[MUQ[tail]] = j
                    tail -= 1
                tail += 1
                MUQ[tail] = j
            
            tail = 0  
            MUQ[0] = cols+1  
            for j in range(cols, -1, -1):  
                while tail >= 0 and MaxH[i][MUQ[tail]] > MaxH[i][j]:  
                    L[MUQ[tail]] = j
                    tail -= 1
                tail += 1
                MUQ[tail] = j      
            
            for j in range(1, cols+1, 1):  
                Temp = MaxH[i][j] * (R[j] - L[j] - 1)  
                if MaxV < Temp: 
                    MaxV = Temp 
        return MaxV