第十章 单调栈part02

503. 下一个更大元素 II

class Solution:
    def nextGreaterElements(self, nums: List[int]) -> List[int]:
        ## 循环数组
        n1 = len(nums)
        nums = nums + nums
        n = len(nums)
        answer = [-1] * n
        stack = [0]
        for i in range(1,n):
            while(len(stack)!= 0 and nums[i] > nums[stack[-1]]):
                    answer[stack[-1]] = (nums[i])
                    stack.pop()
            stack.append(i)
        return (answer[:n1])

42. 接雨水

class Solution:
    def trap(self, height: List[int]) -> int:
        height = list(height)
        result = 0
        stack = [0]
        for i in range(1,len(height)):
            while stack and height[i] > height[stack[-1]]:
                a = stack.pop()
                if stack:
                    h = min(height[i],height[stack[-1]]) - height[a]
                    width = i - stack[-1] - 1
                    result += h * width
            stack.append(i)
        return result