Question: Given an array of integers, every element appears twice except for one. Find that single one. Solution idea: use the property of XORin bit manipulation: x^x=0 and x^1=x