Find the element that appears once when others appear twice.
O(n)
O(1)
def singleNumber(nums): res = 0 for n in nums: res = n ^ res return res