Question

How to find the uncommon elements from two arrays in Java

Answer 1

public class MyClass {
    static void printUncommonElements(int arr1[], int arr2[]) {
        int i = 0, j = 0;
        int len1 = arr1.length, len2 = arr2.length; 

        while(i < len1 && j < len2) {
          if(arr1[i] < arr2[j])
             System.out.println(arr1[i++]);
          else if (arr1[i] > arr2[j]) 
             System.out.println(arr2[j++]);
          else { 
             i++;
             j++;
          }
        }
        while(i < len1 && arr1[i] != arr2[j])
          System.out.println(arr1[i++]);
        i--;  
        while(j < len2 && arr2[j] != arr1[i]) 
          System.out.println(arr2[j++]);
    }
    public static void main(String args[]) {
        int arr1[]= {1, 3, 8,  9, 17, 18};
        int arr2[]= {1, 8, 5, 12, 18, 19, 100, 120};

        printUncommonElements(arr1, arr2);
    }
}



/*
run:

3
5
9
12
17
19
100
120

*/

 

70+ SQL courses for beginners and professionals

Answer 2

import java.util.*; 
import java.util.stream.Collectors;

public class MyClass {
    static void printUncommonElements(int arr1[], int arr2[]) {
        List<Integer> list1 =  Arrays.stream(arr1).boxed().collect(Collectors.toList());
        List<Integer> list2 = Arrays.stream(arr2).boxed().collect(Collectors.toList());

        Set<Integer> hs = new HashSet<Integer>(list1);
        hs.addAll(list2);
        Set<Integer> intersection = new HashSet<Integer>(list1);
        intersection.retainAll(list2);
        hs.removeAll(intersection);
        for (Integer n : hs) {
            System.out.println(n);
        }
    }
    public static void main(String args[]) {
        int arr1[]= {1, 3, 8, 9, 17, 18};
        int arr2[]= {1, 8, 5, 8, 12, 18, 19, 100, 120, 8};

        printUncommonElements(arr1, arr2);
    }
}



/*
run:

17
3
19
100
5
120
9
12

*/

 

70+ SQL courses for beginners and professionals