1.Single Number
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 x=0;
for(int i=0;i<numsSize;i++)
{
x^=nums[i];
}
return x;
}