### LeetCode - Next Greater Element 1 Solution - The Coding Shala

Home >> LeetCode >> next greater element 1
In this post, we will learn how to solve LeetCode's Next Greater Element 1 problem and will implement its solution in Java.

## Next Greater Element 1 Problem

You are given two arrays (without duplicates) nums1 and nums2 where nums1’s elements are a 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.

## Next Greater Element 1 java solution

Approach 1:
We can solve this problem using brute force. The time limit will be O(n^2).

Java Program:
```class Solution {
public int[] nextGreaterElement(int[] nums1, int[] nums2) {
int[] ans = new int[nums1.length];
for(int i=0;i<nums1.length;i++){
int num = nums1[i];
int j = 0;
int flag = 0;
while(nums2[j] != num) j++;
for(int k = j; k<nums2.length; k++){
if(nums2[k] > num) {
ans[i] = nums2[k];
flag = 1;
break;
}
}
if(flag == 0) ans[i] = -1;
}
return ans;
}
}
```

Other Posts You May Like