https://leetcode.com/problems/maximal-rectangle/description/
求最大的‘1’矩阵面积
思路:dp,参考discuss,用三个数组height,left,right表示状态,逐行进行迭代。每行的状态根据上一行状态和当前状态来决定。left[j]表示改行j位置矩阵的左边界,同理right[j]表示右边界,height表示高度,因此面积可用(right[j] - left[j]) * height[j]
计算
class Solution:
def maximalRectangle(self, matrix):
"""
:type matrix: List[List[str]]
:rtype: int
"""
m = len(matrix)
if m == 0:
return 0
n = len(matrix[0])
left, right, height = [0] * n, [n] * n, [0] * n
maxArea = 0
#逐行
for i in range(m):
#填表height(反向亦可)
for j in range(n):
if matrix[i][j] == '1':
height[j] += 1
else:
height[j] = 0
#填表left,从左向右
cur_left = 0
for j in range(n):
if matrix[i][j] == '1':
left[j] = max(left[j], cur_left)
else:
cur_left = j+1
left[j] = 0
#填表right,从右向左
cur_right = n
for j in range(n-1, -1, -1):
if matrix[i][j] == '1':
right[j] = min(right[j], cur_right)
else:
cur_right = j
right[j] = n
#对每个位置计算面积(反向亦可)
for j in range(n):
maxArea = max(maxArea, (right[j] - left[j]) * height[j])
return maxArea