题目描述
Given an array of integers, every element appears twice except for one. Find that single one.
Note:
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?
IDEA
用异或。二进制异或,两位相同为0,不同得1。即两个数相同,异或得0. 0和任何数异或得到该数本身。 将数组中所有数进行异或,其中出现两次的数抵消为0,剩下的就是出现一次的那个数。另外,我的解法没有开辟另外的存储空间
CODE
class Solution {
public:
int singleNumber(int A[], int n) {
for(int i=1;i<n;i++){
A[0]^=A[i];
}
return A[0];
}
};