https://leetcode.com/problems/single-number/description/
题目:求出一个数组中出现一次的数
思路:使用异或运算符, a^0=a,a^a=0;
class Solution {
public:
int singleNumber(vector<int>& nums) {
int sum=0;
for(int x=0;x<nums.size();x++)
sum^=nums[x];
return sum;
}
};