-
Notifications
You must be signed in to change notification settings - Fork 0
/
Question6.java
50 lines (42 loc) · 1.51 KB
/
Question6.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
// Find the intersection of two arrays
import java.util.*;
public class Question6 {
public static ArrayList<Integer> intersectionArray(int arr1[], int arr2[], int n, int m) {
ArrayList<Integer> Intersection = new ArrayList<>();
ArrayList<Integer> list1 = new ArrayList<>();
ArrayList<Integer> list2 = new ArrayList<>();
// Convert arrays to ArrayLists
for (int i = 0; i < n; i++) {
list1.add(arr1[i]);
}
for (int i = 0; i < m; i++) {
list2.add(arr2[i]);
}
// Sort the ArrayLists to enable two-pointer technique
Collections.sort(list1);
Collections.sort(list2);
int i = 0, j = 0;
while (i < list1.size() && j < list2.size()) {
if (list1.get(i).equals(list2.get(j))) {
// Add to result if it's not already present
if (Intersection.isEmpty() || !Intersection.get(Intersection.size() - 1).equals(list1.get(i))) {
Intersection.add(list1.get(i));
}
i++;
j++;
} else if (list1.get(i) < list2.get(j)) {
i++;
} else {
j++;
}
}
return Intersection;
}
public static void main(String[] args) {
int nums1[] = {1,2,2,1};
int nums2[] = {2,2};
int n = nums1.length;
int m = nums2.length;
intersectionArray(nums1, nums2, n, m);
}
}