136. 只出现一次的数字
排序(慢)
class Solution:
def singleNumber(self, nums: List[int]) -> int:
nums.sort()
i = 0
n = len(nums)
while n > 1:
if nums[i] == nums[i+1]:
nums.remove(nums[i+1])
nums.remove(nums[i])
n -= 2
else:
i += 1
n -= 1
return nums[0]
官方解法——位运算
class Solution:
def singleNumber(self, nums: List[int]) -> int:
return reduce(lambda x, y: x ^ y, nums)