代码随想录day59|503. 下一个更大元素 II42. 接雨水

503. 下一个更大元素 II

class Solution:
    def nextGreaterElements(self, nums: List[int]) -> List[int]:
        st = [0]
        result = [-1]*(len(nums)*2)
        nums = nums +nums
        for i in range(1,len(nums)):
            if nums[i] <= nums[st[-1]]:
                st.append(i)
            else:
                while st and nums[i] > nums[st[-1]]:
                    result[st[-1]] = nums[i]
                    st.pop()
                st.append(i)
        return result[:int(len(nums)/2)]

42. 接雨水

class Solution:
    def trap(self, height: List[int]) -> int:
        # 两个思路 首先是stack出现大于的值出现凹槽，右边是当前元素，底是栈顶元素，左边是栈顶第二个元素
        # 当遇到相同的元素时，以右边元素为准，更新栈顶
        # 暴力求解的话，看每列左边右边最大高度中的最小值减去当前高度相加
        area = 0 
        stack = [0]
        for  i in range(1,len(height)):
            if height[i] < height[stack[-1]]:
                stack.append(i)
            elif height[i] == height[stack[-1]]:
                stack.pop()
                stack.append(i)
            else:
                while stack and height[i] > height[stack[-1]]:
                    mid = height[stack.pop()]
                    if stack:
                        width = i - stack[-1] -1
                        heighth = min(height[i],height[stack[-1]])-mid
                        area += width*heighth
                stack.append(i)
        return area