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 nextgreater numbers for nums1's elements in the corresponding places of nums2.

The Next Greater Number of a number x innums1 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 numberfor it in the second array, so output -1.

   For number 1 in the first array, the next greater number for it in thesecond array is 3.

   For number 2 in the first array, there is no next greater number for itin 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 thesecond array is 3.

   For number 4 in the first array, there is no next greater number for itin the second array, so output -1.

Note:

All elements in nums1 and nums2 are unique.

The length of both nums1 and nums2 wouldnot exceed 1000.

    谷歌翻译：您将获得两个数组（不含重复）nums1和nums2，其中nums1的元素是nums2的子集。在nums2的相应位置中查找nums1的所有下一个更大的数字。

    nums1中的下一个更大的数字x是nums2中右边的第一个更大的数字。 如果不存在，则为此数字输出-1。

这题把题目看懂了不难，就是在数组nums1中的元素a，在nums2中找到，再看nums2从当前位置找，找到第一个比a大的数，将他保存起来，若没有，则保存-1。主要就是应该在nums中从后往前找就可以了。代码如下：

public class Solution {
    public int[] nextGreaterElement(int[] findNums, int[] nums) {
        int[] arr=new int[findNums.length];
for(int i=0;i<findNums.length;i++){
int result=findNums[i];
int max=-1;
for(int j=nums.length-1;j>=0;j--){
if(nums[j]==result) break;
else{
if(nums[j]>result)
max=nums[j];
}
}
arr[i]=max;
}
return arr;
    }
}