Leetcode - 只出现一次的数字

class Solution:
    def singleNumber(self, nums: List[int]) -> int:
        lst=[]
        for i in nums:
            if i not in lst:
                lst.append(i)
            else:
                lst.remove(i)
        return lst.pop()