Leetcode 136. Single Number

136. Single Number

• Total Accepted: 140971
• Total Submissions: 276396
• Difficulty: Medium

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?

思路：a^b^b=a以及异或操作的交换律。

代码：

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