本文共 557 字，大约阅读时间需要 1 分钟。
题目：
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 resultsa = Solution()print a.singleNumber([4,5,5,3,2,1,1,4,2])
转载地址：http://ezhci.baihongyu.com/