LeetCode Top100:只出现一次数字
程序员文章站
2022-04-16 23:49:56
...
class Solution(object):
def singleNumber(self, nums):
num=[]
for i in range(len(nums)):
if nums[i] in num:
num.remove(nums[i])
else:
num.append(nums[i])
return num[0]