集合相减算法java_[Java] 蓝桥杯ALGO-10 算法训练 集合运算

package algo10;

import java.util.Scanner;

import java.util.TreeSet;

public class Main {

public static void main(String[] args) {

Scanner in = new Scanner(System.in);

TreeSet treeSetA = new TreeSet();

int n = in.nextInt();

for (int i = 0; i < n; i++) {

treeSetA.add(in.nextInt());

}

TreeSet treeSetB = new TreeSet();

int m = in.nextInt();

for (int i = 0; i < m; i++) {

treeSetB.add(in.nextInt());

}

in.close();

printDivide(treeSetA, treeSetB);

printAdd(treeSetA, treeSetB);

printRemain(treeSetA, treeSetB);

}

public static void printAdd(TreeSet a, TreeSet b) {

a.addAll(b);

for (int i : a) {

System.out.print(i + " ");

}

System.out.println();

}

public static void printDivide(TreeSet a, TreeSet b) {

@SuppressWarnings("unchecked")

TreeSet tempA = (TreeSet) a.clone();

a.removeAll(b);

tempA.removeAll(a);

for (int i : tempA) {

System.out.print(i + " ");

}

System.out.println();

}

public static void printRemain(TreeSet a, TreeSet b) {

a.removeAll(b);

for (int i : a) {

System.out.print(i + " ");

}

System.out.println();

}

}