#496

Next Greater Element I

newbie · 230 · lc easy +17 · verified · 75.8% accepted · 9,754 likes · top 87%

Description

You are given two distinct integer arrays nums1 and nums2, where nums1 is a subset of nums2. For each element in nums1, locate it in nums2 and find the first element to its right that is strictly greater. If no such element exists, use -1.

Return an array of length nums1.length containing these next-greater values.

Example 1:

Input: nums1 = [4,1,2], nums2 = [1,3,4,2]

Output: [-1,3,-1]

Explanation: The next greater element for each value of nums1 is as follows:

- 4 is underlined in nums2 = [1,3,4,2]. There is no next greater element, so the answer is -1.

- 1 is underlined in nums2 = [1,3,4,2]. The next greater element is 3.

- 2 is underlined in nums2 = [1,3,4,2]. There is no next greater element, so the answer is -1.

Example 2:

Input: nums1 = [2,4], nums2 = [1,2,3,4]

Output: [3,-1]

Explanation: The next greater element for each value of nums1 is as follows:

- 2 is underlined in nums2 = [1,2,3,4]. The next greater element is 3.

- 4 is underlined in nums2 = [1,2,3,4]. There is no next greater element, so the answer is -1.

Code

1

2

3

class Solution:
    def nextGreaterElement(self, nums1: List[int], nums2: List[int]) -> List[int]:

class Solution:
    def nextGreaterElement(self, nums1: List[int], nums2: List[int]) -> List[int]: