问题链接https://leetcode-cn.com/problems/next-greater-element-i/description/
public int[] nextGreaterElement(int[] nums1, int[] nums2) {
int[] res = new int[nums1.length];
Map<Integer,Integer> map = new HashMap<>();
for(int i =0;i<nums2.length;i++)
map.put(nums2[i],i);
for(int i = 0;i<nums1.length;i++) {
int pos = map.get(nums1[i]);
int val = -1;
for(int j =pos+1;j<nums2.length;j++) {
if(nums2[j]>nums1[i]) {
val = nums2[j];
break;
}
}
res[i] = val;
}
return res;
}