LeetCode 136. Single Number

1.问题描述

Given a non-empty 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?

Example 1:

Input: [2,2,1]
Output: 1

Example 2:

Input: [4,1,2,1,2]
Output: 4

2.算法分析

该问题可以使用异或运算的特点来解决，首先来总结一下异或运算法则：

1. a ⊕ a = 0
2. a ⊕ b = b ⊕ a
3. a ⊕b ⊕ c = a ⊕ (b ⊕ c) = (a ⊕ b) ⊕ c;
4. d = a ⊕ b ⊕ c 可以推出 a = d ⊕ b ⊕ c.
5. a ⊕ b ⊕ a = b = (a ⊕ a) ⊕ b = 0 ⊕ b 

6.0 ⊕  a = a.

根据2和3的交换律和结合律，可以把nums中出现两次的元素全部交换到一起做异或运算，此时出现两次的n-1个元素异或的值为0，根据法则6，可知n个元素异或的最终结果为只出现一次的那个元素。

3.代码实现

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