85. 最大矩形
给定一个仅包含 0 和 1 的二维二进制矩阵,找出只包含 1 的最大矩形,并返回其面积。
示例:
输入:
[
[“1”,“0”,“1”,“0”,“0”],
[“1”,“0”,“1”,“1”,“1”],
[“1”,“1”,“1”,“1”,“1”],
[“1”,“0”,“0”,“1”,“0”]
]
输出: 6
图像来自https://leetcode-cn.com/problems/maximal-rectangle/solution/cyu-yan-dan-diao-zhan-by-dudugo/
类似于84题求柱状图的最大面积,本题可以将矩阵变换成多个柱状图,使用上一题的方法进行求解。求柱状图的最大面积参考84.柱状图中的最大矩形,注意原始矩阵里面是字符型的,需要变化为数字型的,对后续的计算方便一些。每一行的首位加哨兵[0]的操作也需要提前进行。
from typing import List
class Solution:
def maximalRectangle(self, matrix: List[List[str]]) -> int:
if not matrix: return 0
m = len(matrix)
n = len(matrix[0])
out = 0
#构建一个矩阵,每行的左右两端增加一个0
column = [[0 for i in range(n+2)] for i in range(m)]
for i in range(0, m):#将原始的字符矩阵换成数字矩阵
for j in range(1, n+1):
column[i][j] = int(matrix[i][j-1])
#对数字矩阵的每行进行判断,如果每行有值(不为0),则累加该行上一行的对应元素值
#这样做的目的是,构建m(行数)个柱形图。类似于leetcode 84题,使用84的求柱状图的最大面积
#将一个矩阵,分解为行数个柱状图,进行求解。
for i in range(1, m):
for j in range(1,n+1):
if column[i][j] == 1:
column[i][j] += column[i-1][j]
#使用的是84题,单调递增栈的做法,计算柱状图的最大面积
def max_area(s: List[int])->int:
res = 0
stack = []
for i in range(n+2):
while stack and s[stack[-1]] > s[i]:
height_index = stack.pop()
res = max(res, (i - stack[-1] - 1) * s[height_index])
stack.append(i)
return res
#循环重复m次,计算出每一行的最大柱状面积,再找一个最大值输出
for i in range(m):
out = max(out, max_area(column[i]))
return out
if __name__ == "__main__":
s = Solution()
print(s.maximalRectangle(["1","0","1","1","1"]))
# print(s.maximalRectangle([
# ["1","0","1","0","0"],
# ["1","0","1","1","1"],
# ["1","1","1","1","1"],
# ["1","0","0","1","0"]
# ]))
这道题还可以使用动态规划的方法进行求解:
下面是powcai大佬的解答:
- 用 height_j 记录第 i 行为底,第 j 列高度是多少.
- 用 left_j 记录第 i 行为底, 第 j 列左边第一个小于 height_j[ j ] 的位置
- 用 right_j 记录第 i 行为底, 第 j 列右边第一个小于 height_j[ j ] 的位置
class Solution:
def maximalRectangle(self, matrix: List[List[str]]) -> int:
if not matrix or not matrix[0]: return 0
row = len(matrix)
col = len(matrix[0])
left_j = [-1] * col
right_j = [col] * col
height_j = [0] * col
res = 0
for i in range(row):
cur_left = -1#对于每一行,初始化左边界-1, 右边界为列宽度
cur_right = col
for j in range(col):#更新高度
if matrix[i][j] == "1":
height_j[j] += 1
else:
height_j[j] = 0
for j in range(col):#更新右边界
if matrix[i][j] == "1":
left_j[j] = max(left_j[j], cur_left)
else:
left_j[j] = -1
cur_left = j
for j in range(col - 1, -1, -1):#更新左边界
if matrix[i][j] == "1":
right_j[j] = min(right_j[j], cur_right)
else:
right_j[j] = col
cur_right = j
for j in range(col):#更新面积
res = max(res, (right_j[j] - left_j[j] - 1) * height_j[j])
return res
作者:powcai
链接:https://leetcode-cn.com/problems/maximal-rectangle/solution/yu-zhao-zui-da-ju-xing-na-ti-yi-yang-by-powcai/
来源:力扣(LeetCode)
著作权归作者所有。商业转载请联系作者获得授权,非商业转载请注明出处。