【java】496. Next Greater Element I

问题链接https://leetcode-cn.com/problems/next-greater-element-i/description/

public int[] nextGreaterElement(int[] nums1, int[] nums2) {
         int[] res = new int[nums1.length];
        Map map = new HashMap<>();
        for(int i =0;inums1[i]) {
        			val = nums2[j];
        			break;
        		}
        	}
        	res[i] = val;
        }
        return res;
    }