In scala, how can I get the count of elements that never shown in both arrays?

Question

for example, i have array a Array[Int] = Array(1, 1, 2, 2, 3) array b Array[Int] = Array(2, 3, 4, 5) i'd like to count how many elements that only shown in a or b. in this case, it's (1, 1, 4, 5), so the count is 4.

I tried diff, union, intersect, but I couldn't find a combination of them to get the result I want.

length of the unique values of the diff set – CAPSLOCK Apr 03 '19 at 10:51 — CAPSLOCK, Apr 03 '19 at 10:51

score 5 · Answer 1 · answered Apr 03 '19 at 10:48

5

I think you can try something like this one but this is not good approach, still this will do the trick.

a.filterNot(b contains).size + b.filterNot(a contains).size

answered Apr 03 '19 at 10:48

Rex

558
2
9

score 4 · Accepted Answer · answered Apr 03 '19 at 11:45

4

Same idea as the other answer, but linear time:

 a.iterator.filterNot(b.toSet).size + b.iterator.filterNot(a.toSet).size

(.iterator to avoid creating intermediate collections)

answered Apr 03 '19 at 11:45

Dima

39,570
6
44
70

In scala, how can I get the count of elements that never shown in both arrays?

2 Answers2