Leetcode42-接雨水
思路:双指针
代码:
class Solution:
def trap(self, height: List[int]) -> int:
ans = 0
left = 0
right = len(height) - 1
max_left = 0
max_right = 0
while left < right:
max_left = max(max_left, height[left])
max_right = max(max_right, height[right])
if height[left] < height[right]:
ans += max_left - height[left]
left += 1
else:
ans += max_right - height[right]
right -= 1
return ans