-----QUESTION-----
Given an array of integers, every element appears
Note:
Your algorithm should have a linear runtime complexity. Could you implement it without using extra memory?
-----SOLUTION-----
class Solution {
public:
int singleNumber(int A[], int n) {
int result = A[0];
int i = 1;
while(i<n)
{
result = A[i] ^ result;
i++;
}
return result;
}
};