496. Next Greater Element I

waiting不是违停

于 2022-07-14 10:47:51 发布

阅读量118

点赞数

分类专栏： LeetCode Python刷题文章标签：单调栈 Next Greater Element 栈操作编程算法递归替代

本文链接：https://blog.csdn.net/weixin_44737922/article/details/125779663

版权

LeetCode Python刷题专栏收录该内容

221 篇文章 1 订阅

订阅专栏

用单调栈解决

class Solution:
    def nextGreaterElement(self, nums1: List[int], nums2: List[int]) -> List[int]:
        res = [-1]*len(nums1)
        stack = [0]
        for i in range(1,len(nums2)):
            if nums2[i] <= nums2[stack[-1]]:
                stack.append(i)
            else:
                while stack and nums2[i]>nums2[stack[-1]]:
                    if nums2[stack[-1]] in nums1:
                        idx = nums1.index(nums2[stack[-1]])
                        res[idx] = nums2[i]
                    stack.pop()
                stack.append(i)
        return res