-
Notifications
You must be signed in to change notification settings - Fork 40
/
NextGreaterElementI.js
60 lines (56 loc) · 1.89 KB
/
NextGreaterElementI.js
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
// Source : https://leetcode.com/problems/next-greater-element-i
// Author : Dean Shi
// Date : 2017-02-25
/***************************************************************************************
*
* You are given two arrays (without duplicates) nums1 and nums2 where nums1’s elements
* are subset of nums2. Find all the next greater numbers for nums1's elements in the
* corresponding places of nums2.
*
* The Next Greater Number of a number x in nums1 is the first greater number to its
* right in nums2. If it does not exist, output -1 for this number.
*
* Example 1:
*
* Input: nums1 = [4,1,2], nums2 = [1,3,4,2].
* Output: [-1,3,-1]
* Explanation:
* For number 4 in the first array, you cannot find the next greater number for it
* in the second array, so output -1.
* For number 1 in the first array, the next greater number for it in the second
* array is 3.
* For number 2 in the first array, there is no next greater number for it in the
* second array, so output -1.
*
* Example 2:
*
* Input: nums1 = [2,4], nums2 = [1,2,3,4].
* Output: [3,-1]
* Explanation:
* For number 2 in the first array, the next greater number for it in the second
* array is 3.
* For number 4 in the first array, there is no next greater number for it in the
* second array, so output -1.
*
* Note:
*
* All elements in nums1 and nums2 are unique.
* The length of both nums1 and nums2 would not exceed 1000.
*
*
***************************************************************************************/
/**
* @param {number[]} findNums
* @param {number[]} nums
* @return {number[]}
*/
var nextGreaterElement = function(findNums, nums) {
const hash = {}
let element, index
nums.forEach((n, i) => { hash[n] = i })
return findNums.map((n) => {
index = hash[n]
while ((element = nums[++index]) < n);
return element === void(0) ? -1 : element
})
};