forked from gouthampradhan/leetcode
-
Notifications
You must be signed in to change notification settings - Fork 0
/
NextGreaterElementI.java
67 lines (61 loc) · 2.25 KB
/
NextGreaterElementI.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
package array;
/**
* Created by gouthamvidyapradhan on 09/02/2018.
* 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.
*/
public class NextGreaterElementI {
/**
* Main method
* @param args
* @throws Exception
*/
public static void main(String[] args) throws Exception{
int[] A = {4,1,2};
int[] B = {1,3,4,2};
int[] result = new NextGreaterElementI().nextGreaterElement(A, B);
System.out.println(result);
}
public int[] nextGreaterElement(int[] nums1, int[] nums2) {
int[] result = new int[nums1.length];
for(int i = 0; i < nums1.length; i ++){
int n = nums1[i];
boolean found = false;
int nF = 0;
for(int j = 0; j < nums2.length; j ++){
if(nums2[j] == n){
found = true;
} if(found){
if(nums2[j] > n){
nF = nums2[j];
break;
}
}
}
if(found){
result[i] = nF;
} else{
result[i] = -1;
}
}
return result;
}
}