class Solution:
def maximalRectangle(self, matrix: List[List[str]]) -> int:
def MHA(heights):
if len(heights) == 0:
return 0
stack = []
left = []
right = []
for i in range(len(heights)):
while len(stack) != 0 and heights[stack[-1]] >= heights[i]:
stack.pop()
if len(stack) == 0:
left.append(0)
else:
left.append(stack[-1] + 1)
stack.append(i)
stack = []
for i in range(len(heights) - 1, -1, -1):
while len(stack) != 0 and heights[stack[-1]] >= heights[i]:
stack.pop()
if len(stack) == 0:
right.append(len(heights) - 1)
else:
right.append(stack[-1] - 1)
stack.append(i)
right = right[::-1]
ans = []
for i in range(len(right)):
ans.append((right[i] - left[i] + 1) * heights[i])
return max(ans)
if len(matrix) == 0:
return 0
area = []
x = [0] * len(matrix[0])
for i in range(len(matrix)):
for j in range(len(matrix[i])):
if int(matrix[i][j]) == 0:
x[j] = 0
else:
x[j] += int(matrix[i][j])
area.append(MHA(x))
print(max(area))
return max(area)
450. Delete Node in a BST | 445. Add Two Numbers II |
442. Find All Duplicates in an Array | 437. Path Sum III |
436. Find Right Interval | 435. Non-overlapping Intervals |
406. Queue Reconstruction by Height | 380. Insert Delete GetRandom O(1) |
332. Reconstruct Itinerary | 368. Largest Divisible Subset |
377. Combination Sum IV | 322. Coin Change |
307. Range Sum Query - Mutable | 287. Find the Duplicate Number |
279. Perfect Squares | 275. H-Index II |
274. H-Index | 260. Single Number III |
240. Search a 2D Matrix II | 238. Product of Array Except Self |
229. Majority Element II | 222. Count Complete Tree Nodes |
215. Kth Largest Element in an Array | 198. House Robber |
153. Find Minimum in Rotated Sorted Array | 150. Evaluate Reverse Polish Notation |
144. Binary Tree Preorder Traversal | 137. Single Number II |
130. Surrounded Regions | 129. Sum Root to Leaf Numbers |