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
andnums2
are unique. - The length of both
nums1
andnums2
would not exceed 1000.
题目其实很简单,关键在于理解:
以nums1 = [4, 1, 2],nums2 = [1, 3, 4, 2]为例,
nums1[0] = 4,对应为nums2[2],在nums2中,4右边没有大于4的值,因此返回-1
nums1[1] = 1,对应为nums2[0],在nums2中,1右边第一个大于1的值为3,因此返回3
nums1[2] = 2,对应为nums2[3],在nums2中,2右边没有大于4的值,因此返回-1
程序如下所示:
class Solution {
public int[] nextGreaterElement(int[] nums1, int[] nums2) {
List<Integer> list = new ArrayList<>();
Map<Integer, Integer> map = new HashMap<>();
for (int i = 0; i < nums2.length; ++ i){
map.put(nums2[i], i);
}
for (int val1 : nums1){
int cur = Integer.MAX_VALUE;
int end = map.get(val1);
list.add(-1);
for (int i = end; i < nums2.length; ++ i){
if (nums2[i] > val1){
list.set(list.size() - 1, nums2[i]);
break;
}
}
}
int[] res = new int[list.size()];
for (int i = 0; i < res.length; ++ i){
res[i] = list.get(i);
}
return res;
}
}