Given an array of integers, every element appears twice except for one. Find that single one.
Note:
Your algorithm should have a linear runtime complexity. Could you implement it without using extra memory?
Have you been asked this question in an interview?
public class Solution {
public int singleNumber(int[] A) {
int once = 0, len = A.length;
for(int i = 0; i < len; ++i)
once ^= A[i];
return once;
}
}