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.The length of both nums1 and nums2 would not exceed 1000.
Subscribe to see which companies asked this question.
public class demo3 {	 public int[] nextGreaterElement(int[] findNums, int[] nums) {  	        int[] result = new int[findNums.length];  	        for (int i = 0; i < findNums.length; i++) {  	            int j = 0, flag = 0, length = nums.length;  	            for (; j < length; j++) {  	                if (flag == 0 && nums[j] == findNums[i])  	                    flag = 1;  	                if(flag == 1 && nums[j] > findNums[i]) {  	                    result[i] = nums[j];  	                    break;  	                }  	            }  	            if (j == length)  	                result[i] = -1;  	        }  	        return result;  	    }	 	public static void main(String[] args){		int[] findNums={4,1,2};		int[] nums={1,3,4,2};		demo3 r = new demo3();		System.out.PRintln(r.nextGreaterElement(findNums, nums));	}}为num1中的每个元素找到其在num2中的下一个较大值。尽量减少循环的次数，所以判断num1中元素的位置和寻找下一个较大值放在一个循环体内。