Given an array of integers, every element appears twice except for one. Find that single one.
Your algorithm should have a linear runtime complexity. Could you implement it without using extra memory?
Solution
int singleNumber(int* nums, int numsSize) { for (int i = 1;i < numsSize;i++) { nums[0] ^= nums[i]; } return nums[0];}