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?
class Solution {
public:
int singleNumber(int A[], int n) {
int num=0;
for(int i=0; i<n; i++){
num^=A[i];
}
return num;
}
};LeetCode: Single Number [136],布布扣,bubuko.com
原文：http://blog.csdn.net/harryhuang1990/article/details/34533689