class Solution:
def largestRectangleArea(self, heights: List[int]) -> int:
if len(heights) == 0:
return 0
stack = []
left = []
right = []
stackr = []
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)
while len(stackr) != 0 and heights[stackr[-1]] >= heights[len(heights) - i - 1]:
stackr.pop()
if len(stackr) ==0 :
right.append(len(heights) - 1)
else:
right.append(stackr[-1] -1 )
stackr.append(len(heights) - i - 1 )
print("Left", left)
print("right", right[::-1])
right = right[::-1]
ans =[]
for i in range(len(right)):
ans.append((right[i] - left[i] +1) * heights[i])
return max(ans)
2099. Find Subsequence of Length K With the Largest Sum | 1608A - Find Array |
416. Partition Equal Subset Sum | 1446. Consecutive Characters |
1618A - Polycarp and Sums of Subsequences | 1618B - Missing Bigram |
938. Range Sum of BST | 147. Insertion Sort List |
310. Minimum Height Trees | 2110. Number of Smooth Descent Periods of a Stock |
2109. Adding Spaces to a String | 2108. Find First Palindromic String in the Array |
394. Decode String | 902. Numbers At Most N Given Digit Set |
221. Maximal Square | 1200. Minimum Absolute Difference |
1619B - Squares and Cubes | 1619A - Square String |
1629B - GCD Arrays | 1629A - Download More RAM |
1629C - Meximum Array | 1629D - Peculiar Movie Preferences |
1629E - Grid Xor | 1629F1 - Game on Sum (Easy Version) |
2148. Count Elements With Strictly Smaller and Greater Elements | 2149. Rearrange Array Elements by Sign |
2150. Find All Lonely Numbers in the Array | 2151. Maximum Good People Based on Statements |
2144. Minimum Cost of Buying Candies With Discount | Non empty subsets |