496-下一个更大的数I

Description
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:

1. All elements in nums1 and nums2 are unique.
2. The length of both nums1 and nums2 would not exceed 1000.

---

问题描述
给定两个没有重复元素的数组nums1, nums2,nums1为nums2的子集。找出nums2中nums1所有元素的下一个更大的元素。
nums1中x的下一个更大的元素为nums2中x右边的第一个比x大的数。如果不存在，则为-1

---

问题分析

维护stack和一个map(存放nums2中x对应的下一个更大的数)

若当前元素小于栈顶元素，则入栈，否则出栈，并将出栈元素作为key，当前元素作为value放入map

最后遍历num1,若map中有当前元素的key，说明当前元素有下一个更大的数，否则没有，对应值为-1

---

解法

class Solution {
    public int[] nextGreaterElement(int[] nums1, int[] nums2) {
        Map<Integer,Integer> map = new HashMap<Integer,Integer>();
        Stack<Integer> stack = new Stack<Integer>();

        for(int num : nums2){
            while(!stack.empty() && stack.peek() < num){
                map.put(stack.pop(),num);
            }
            stack.push(num);
        }
        for(int i = 0;i < nums1.length;i++) nums1[i] = map.getOrDefault(nums1[i],-1);

        return nums1;
    }
}