Easy-13

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?

AC:

int singleNumber(int* nums, int numsSize) {
    int result=0;
    for(int i=0;i<numsSize;i++)
    {
        result^=nums[i];
    }
    return result;
}

tips:突然想起异或。。。之前想了半天加加减减平均数之类的没想通。。