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
Input: [2,2,1]
Output: 1
Solution
class Solution(object):
def singleNumber(self, nums):
"""
:type nums: List[int]
:rtype: int
"""
ret = nums[0]
for e in range(1,len(nums)):
ret ^=nums[e]
return ret