Leetcode战记 day1 单数字问题

问题：一个数组中全为正整数，有一个数字只出现了一次，其它均出现了两次，找出这个数字

思路：使用异或运算符      1. a ⊕ a = 0

                                          2. a ⊕ 0 = a

                                          3. a ⊕ b = b ⊕ a

                                          4. a ⊕b ⊕ c = a ⊕ (b ⊕ c) = (a ⊕ b) ⊕ c;

                                          5. d = a ⊕ b ⊕ c 可以推出 a = d ⊕ b ⊕ c.

                                          6. a ⊕ b ⊕ a = b.

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