leetcode 单调栈 42接雨水 84柱状图最大矩形

记一下刷的题

42接雨水

1.动态规划，时间复杂度O(n)

class Solution:
    def trap(self, height: List[int]) -> int:
        if not height:return 0
        n = len(height)
        max_left=[0]*n
        max_right=[0]*n
        max_left[0]=height[0]
        max_right[-1]=height[-1]
        #找位置i左边最大值
        for i in range(1,n):
            max_left[i]=max(height[i],max_left[i-1])
        #找出位置i右边的最大值
        for i in range(n-2,-1,-1):
            max_right[i]=max(height[i],max_right[i+1])
        res = 0
        for i in range(n):
            res += min(max_left[i],max_right[i])-height[i]
        return res
    

2.双指针，时间复杂度O(n)

class Solution:
    def trap(self, height: List[int]) -> int:
        if not height:return 0
        left = 0
        right = len(height)-1
        res=0
        #记录左右最大值
        left_max = height[left]
        right_max=height[right]
        while left<right:
            if height[left]<height[right]:
                if left_max>height[left]:
                    res += left_max-height[left