leetcode_496 Next Greater Element I

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.

翻译：在num2数组中找到某个元素右侧第一个大于它的元素的值。
例如对于数组[1,3,4,2]，各元素右侧第一个大于它们的依次是：3, 4，-1，-1

我的解法用到了递归法：

    public int[] nextGreaterElement(int[] findNums, int[] nums) {
        int need[] = new int[findNums.length];
        Map<Integer, Integer> dataMap = getDataIndex(nums);
        for(int i=0;i<findNums.length;i++){
            int index = dataMap.get(findNums[i]);
            // 从元素右侧第一个位置开始找
            need[i]= getGreaterNumber(findNums[i], nums ,index+1);          
        }
        return need;
    }

    // 在数组中从firstPos位置开始向右查找第一个大于a的数，递归方法！
    public int getGreaterNumber(int a, int[] nums ,int firstPos){
        if(firstPos == nums.length )
            return -1;
        if(nums[firstPos]>a)
            return nums[firstPos];
        else
            return getGreaterNumber(a, nums ,firstPos+1);       
    }

    // 返回数组中每个元素各自的下标
    public Map<Integer, Integer> getDataIndex(int[] nums){
        Map<Integer, Integer> dataMap = new HashMap<Integer, Integer>();
        for(int i=0;i<nums.length;i++)
            dataMap.put(nums[i], i);
        return dataMap;         
    }

总结：问题看似复杂，实际主要是看num2数组怎样查找的，与num1数组几乎无关。