136. Single Number

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

1.比较浪费空间的方法，用一个map映射，统计次数，找出只出现一次的数字：

class Solution {
public:
    int singleNumber(vector<int>& nums) {
        int len=nums.size();
        map<int,int> mp;
        for(int i=0;i<len;i++){
            if(mp.count(nums[i])==0){
                mp[nums[i]]=0;
            }else{
                mp[nums[i]]++;
            }
        }
        map<int,int>::iterator it=mp.begin();
        for(; it != mp.end(); ++it){
            if(it->second == 0){
                break;
            }
        }
        return it->first;
    }
};

def singleNumber(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        res_dict={}
        for num in nums:
            res_dict[num]=res_dict.get(num,0)+1
        for key, val in res_dict.items():
            if val == 1:
                return key

2.既然除了一个整数之外其他的整数都是“成对出现”，那要是有办法把这个一对直接消去就好了。方法很简单，用异或（^）运算来进行消除，这样成对的整数会被消成0，最后0和单独的整数异或结果不变。
异或：相同为0，不同为1.
c++:

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

python:

def singleNumber(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        res=0
        for i in range(len(nums)):
            res ^= nums[i]
        return res