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?
数组所有元素异或
int singleNumber(int* nums, int numsSize) {
int result = nums[0];
int i = 1;
for (i = 1; i < numsSize; i++)
result = result ^ nums[i];
return result;
}
扩展思考
(1)数组中有两个只出现一次的元素,其余元素均出现两次。将所有元素异或的两个Single Number的异或值,以该值中为1的位将数组区分为两组,再分别求Single Number
(2)数组中除出现一次的元素,其余元素均出现k次。若k为偶数,同(1);若k为奇数,所有元素按位相加(不进位),将所得值每一位对k取模,得所求元素。