class Solution:
def trap(self, height: List[int]) -> int:
maxl = []
maxr = []
if(len(height) == 0):
return 0
maxl.append(height[-1])
maxr.append(height[0])
for i in range(1, len(height), 1):
maxr.append(max(height[i], maxr[-1]))
for i in range(len(height) - 2, -1, -1):
maxl.append(max(height[i], maxl[-1]))
count = 0
maxl.reverse()
for i in range(len(height)):
count+= min(maxr[i], maxl[i]) - height[i]
return count
150. Evaluate Reverse Polish Notation | 144. Binary Tree Preorder Traversal |
137. Single Number II | 130. Surrounded Regions |
129. Sum Root to Leaf Numbers | 120. Triangle |
102. Binary Tree Level Order Traversal | 96. Unique Binary Search Trees |
75. Sort Colors | 74. Search a 2D Matrix |
71. Simplify Path | 62. Unique Paths |
50. Pow(x, n) | 43. Multiply Strings |
34. Find First and Last Position of Element in Sorted Array | 33. Search in Rotated Sorted Array |
17. Letter Combinations of a Phone Number | 5. Longest Palindromic Substring |
3. Longest Substring Without Repeating Characters | 1312. Minimum Insertion Steps to Make a String Palindrome |
1092. Shortest Common Supersequence | 1044. Longest Duplicate Substring |
1032. Stream of Characters | 987. Vertical Order Traversal of a Binary Tree |
952. Largest Component Size by Common Factor | 212. Word Search II |
174. Dungeon Game | 127. Word Ladder |
123. Best Time to Buy and Sell Stock III | 85. Maximal Rectangle |