CODEWITHSUNDEEP
arraysjava
edaklij
edaklij

Reputation: 4251

Symmetric difference of two Java arrays

I have two arrays 

 String[] ID1={"19","20","12","13","14"};

 String[] ID2={"10","11","12","13","15"};

How can I get following answer while comparing above two arrays.

I want to exclude common elements while comparing above two arrays.

 String[] Result={"14","15","19","20","10","11"};

Upvotes: 3

Views: 4182

Answers (2)

Thilo
Thilo

Reputation: 262814

Seems like you want the union of the two sets (no duplicates, right?) minus the intersection:

Set<Integer> union = new HashSet<Integer>(Arrays.asList(ID1));
union.addAll(Arrays.asList(ID2);

Set<Integer> intersection = new HashSet<Integer>(Arrays.asList(ID1));
intersection.retainAll(Arrays.asList(ID2);

union.removeAll(intersection);

// result is left in "union" (which is badly named now)

(I changed your String to Integer, which seems to fit the data better, but it would work with String the same way)

Upvotes: 7

Aleksander Gralak
Aleksander Gralak

Reputation: 1509

It looks like XOR operation ;)

Please describe your needs a little bit more directly. Pseudocode:

foreach s in ID1 {
  if(ID2.contains(s)) {
    ID2.remove(s)
  } else {
    ID2.add(s)
  }
}

ID2 will contain your result. In assumption that there are not duplicates in both arrays.

Upvotes: 2

Related Questions