题目:
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?
代码:
class Solution(object):
def singleNumber(self, nums):
"""
:type nums: List[int]
:rtype: int
"""
results = 0
for i in nums:
results^=i
return results
a = Solution()
print a.singleNumber([4,5,5,3,2,1,1,4,2])