Given an array of integers, every element appears twice except for one. Find that single one.
Note:
Your algorithm should have a linear runtime complexity. Could you implement it without using extra memory?
|
1 |
return nums.reduce(0) { $0 ^ $1 } |