[leetcode-136]Single Number(c)

问题描述：
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?

分析：这道题真的是毫无思路，看了答案之后，才拍案叫绝，充分利用了异或运算将导致两个元素清0的特点，此外，异或还具有交换律和结合律，才使得如何顺序的解决。

参考文章：这里写链接内容

代码如下：8ms

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