LeetCode 85 - 最大矩形

题目描述

85. 最大矩形

解法一：柱状图+DP（Python）

详细参考 官方题解

class Solution:
    def maximalRectangle(self, matrix: List[List[str]]) -> int:
        maxarea = 0
        dp = [[0] * len(matrix[0])for _ in range(len(matrix))]
        for i in range(len(matrix)):
            for j in range(len(matrix[0])):
                if matrix[i][j] == '0': continue 
                width = dp[i][j] = dp[i][j - 1] + 1 if j else 1
                for k in range(i, -1, -1):
                    width = min(width, dp[k][j])
                    maxarea = max(maxarea, width*(i-k+1))
        return maxarea

解法二：柱状图+栈（Python）

这里用到了LeetCode 84题中求对柱状图求最大面积的算法，详细内容可点击 这里

class Solution:
    def leetcode84(self, heights):
        st = []
        heights = [0] + heights + [0]
        maxarea = 0
        for i in range(len(heights)):
            while st and heights[st[-1]] > heights[i]:
                tmp = st.pop()
                maxarea = max(maxarea, heights[tmp] * (i - st[-1] - 1))
            st.append(i)
        return maxarea

    def maximalRectangle(self, matrix: List[List[str]]) -> int:
        if not matrix: return 0
        maxarea = 0
        dp = [0] * len(matrix[0])
        for i in range(len(matrix)):
            for j in range(len(matrix[0])):
                dp[j] = dp[j] + 1 if matrix[i][j] == '1' else 0
            maxarea = max(maxarea, self.leetcode84(dp))
        return maxarea

解法三：DP（Python）

这里注意一下，我们所取的矩形的底边由半开半闭区间$[l,r)$决定，也就是说$l$指向的是最左边为1的位置，$r$所指为最右边为0的位置

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

        m = len(matrix)
        n = len(matrix[0])

        left = [0] * n
        right = [n] * n
        height = [0] * n

        maxarea = 0

        for i in range(m):
            cur_l, cur_r = 0, n
            for j in range(n):
                if matrix[i][j] == '1':
                    height[j] += 1
                else:
                    height[j] = 0
            for j in range(n):
                if matrix[i][j] == '1':
                    left[j] = max(left[j], cur_l)
                else:
                    left[j] = 0
                    cur_l = j + 1
            for j in range(n - 1, -1, -1):
                if matrix[i][j] == '1':
                    right[j] = min(right[j], cur_r)
                else:
                    right[j] = n
                    cur_r = j
            for j in range(n):
                maxarea = max(maxarea, height[j] * (right[j] - left[j]))
        
        return maxarea