Java中两组的对称差异

Question

TreeSet我的应用程序中有两个:

set1 = {501,502,503,504}
set2 = {502,503,504,505}

我想获得这些集的对称差异,以便我的输出将是集合:

set = {501,505}

Answer 1

你是在对称差异之后.这在Java教程中讨论.

Set<Type> symmetricDiff = new HashSet<Type>(set1);
symmetricDiff.addAll(set2);
// symmetricDiff now contains the union
Set<Type> tmp = new HashSet<Type>(set1);
tmp.retainAll(set2);
// tmp now contains the intersection
symmetricDiff.removeAll(tmp);
// union minus intersection equals symmetric-difference

Answer 2

你可以用 CollectionUtils#disjunction

编辑:

或者使用较少的Java-5之前的版本,使用Guava Sets#symmetricDifference