UniqueNumber

package uniqueNumber;

import java.util.Arrays;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;

public class UniqueNumber {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        int[] oneNum = Arrays.stream(scanner.nextLine().split(", "))
                .mapToInt(Integer::parseInt)
                .toArray();

        int[] twoNum = Arrays.stream(scanner.nextLine().split(", "))
                .mapToInt(Integer::parseInt)
                .toArray();

        Set<Integer> setNum = new HashSet<>();


        int size = Math.max(oneNum.length, twoNum.length);
        for (int i = 0; i < oneNum.length; i++) {
            setNum.add(oneNum[i]);
        }
        Set<Integer> doubleNum = new HashSet<>();
        for (int i = 0; i < twoNum.length; i++) {
            if (setNum.contains(twoNum[i])) {
                doubleNum.add(twoNum[i]);
            } else {
                setNum.add(twoNum[i]);
            }
        }

        for (Integer n : setNum) {
            if (!doubleNum.contains(n)) {
                System.out.print(n + " ");
            }
        }

    }
}