代码随想录算法训练营Day 59| 单调栈part02 | 503.下一个更大元素II、42. 接雨水

代码随想录算法训练营Day 59| 单调栈part02 | 503.下一个更大元素II、42. 接雨水

---

---

503.下一个更大元素II

题目链接

一、单调栈

class Solution(object):
    def nextGreaterElements(self, nums):
        """
        :type nums: List[int]
        :rtype: List[int]
        """
        res=[-1]*len(nums)
        stack=[]
        for i in range(len(nums)*2):
            while len(stack) != 0 and nums[stack[-1]]<nums[i%len(nums)]:
                res[stack[-1]] = nums[i%len(nums)]
                stack.pop()
            stack.append(i%len(nums))
        return res

---

42. 接雨水

题目链接

一、双指针法

class Solution(object):
    def trap(self, height):
        """
        :type height: List[int]
        :rtype: int
        """
        # 动态规划/双指针/图解
        maxleft = [0]*len(height)
        maxright = [0]*len(height)
        maxleft[0] = height[0]
        maxright[len(height)-1] = height[-1]
        res=0
        for i in range(1,len(height)):
            maxleft[i]=max(height[i],maxleft[i-1])
        for i in range(len(height)-2,-1,-1):
            maxright[i]=max(height[i],maxright[i+1])
        for i in range(len(height)):
            res += min(maxleft[i],maxright[i])-height[i]
        return res

二、单调栈

class Solution(object):
    def trap(self, height):
        """
        :type height: List[int]
        :rtype: int
        """

        # 单调栈
        res=0
        stack=[0]
        for i in range(1,len(height)):
            while len(stack)!=0 and height[stack[-1]] < height[i]:
                mid = stack.pop()
                if stack:
                    h = min(height[stack[-1]],height[i])-height[mid]
                    w = i - stack[-1] - 1
                    res += h*w  
            stack.append(i)
        return res

---