LeetCode: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?

 

在《编程之美》里面见过，很巧妙的一种异或运算的解决方案。

 

class Solution {
public:
    int singleNumber(vector<int>& nums) {
        int res = 0;
        for(int i = 0;i<nums.size();i++){
            res = res ^ nums[i];
        }
        return res;
    }
};