-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathUnionofArray.java
More file actions
70 lines (62 loc) · 1.86 KB
/
UnionofArray.java
File metadata and controls
70 lines (62 loc) · 1.86 KB
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
68
69
70
import java.util.*;
public class UnionofArray {
public static ArrayList<Integer> findUnion(int arr1[], int arr2[], int n, int m) {
ArrayList<Integer> al = new ArrayList<>();
int i = 0;
int j = 0;
while (i < n && j < m) {
if (arr1[i] < arr2[j]) {
if (al.isEmpty() == false && al.get(al.size() - 1) == arr1[i]) {
i++;
} else {
al.add(arr1[i]);
i++;
}
}
else if (arr1[i] > arr2[j]) {
if (al.isEmpty() == false && al.get(al.size() - 1) == arr2[j]) {
j++;
} else {
al.add(arr2[j]);
j++;
}
}
else {
if (al.isEmpty() == false && al.get(al.size() - 1) == arr1[i]) {
i++;
j++;
} else {
al.add(arr1[i]);
i++;
j++;
}
}
}
while (j < m) {
if (al.isEmpty() == false && al.get(al.size() - 1) == arr2[j]) {
j++;
}
else{
al.add(arr2[j]);
j++;
}
}
while (i < n) {
if (al.isEmpty() == false && al.get(al.size() - 1) == arr1[i]) {
al.add(arr1[i]);
i++;
}
else{
al.add(arr1[i]);
i++;
}
}
return (al);
}
public static void main(String[] args) {
int arr1[] = { 1, 2, 2 };
int arr2[] = { 1, 3, 4 };
ArrayList<Integer> al = findUnion(arr1, arr2, 3, 3);
System.out.println(al);
}
}