Java-DSA/UnionAndIntersection.java at main · iamkaynat/Java-DSA · GitHub

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
public class UnionAndIntersection {
    public static void main(String[] args) {
        int arr1[] = { 1, 3, 4, 5, 7 };
        int arr2[] = { 2, 3, 5, 6 };
        union(arr1, arr2);
        System.out.println();
        intersection(arr1, arr2);
    }

    // Assuming elements are distinct
    static void union(int[] arr1, int[] arr2) {
        int i = 0;
        int j = 0;
        int m = arr1.length;
        int n = arr2.length;
        while (i < m && j < n) {
            if (arr1[i] == arr2[j]) {
                System.out.print(arr1[i] + " ");
                i++;
                j++;

            }
            if (arr1[i] < arr2[j]) {
                System.out.print(arr1[i] + " ");
                i++;
            } else {
                System.out.print(arr2[j] + " ");
                j++;
            }

        }
        while (i < m) {
            System.out.print(arr1[i] + " ");
            i++;
        }
        while (j < n) {
            System.out.print(arr2[j] + " ");
            j++;
        }

    }

    static void intersection(int[] arr1, int[] arr2) {
        int i = 0;
        int j = 0;
        int m = arr1.length;
        int n = arr2.length;
        while (i < m && j < n) {
            if (arr1[i] < arr2[j]) {
                i++;

            } else {
                j++;
            }
            if (arr1[i] == arr2[j]) {
                System.out.print(arr1[i] + " ");
                i++;
                j++;

            }

        }
    }

}