链接:136. 只出现一次的数字 - 力扣(LeetCode)
1 class Solution(object): 2 def singleNumber(self, nums): 3 """ 4 :type nums: List[int] 5 :rtype: int 6 """ 7 length = len(nums) 8 i = 0 9 res = 0 10 while i < length: 11 res = res ^ nums[i] 12 i += 1 13 return res