Leetcode之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

代码：

语言一——C++：

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

语言二——python：

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