1
 2
 3
 4
 5
 6
 7
 8
 9
10

def next_greater_element(nums):
    result = [-1] * len(nums)
    stack = []  # 单调递增栈

    for i, num in enumerate(nums):
        while stack and nums[stack[-1]] < num:
            result[stack.pop()] = num
        stack.append(i)

    return result