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?
题意
一个整数数组,
只有一个元素只出现一次,其他每个元素都出现两次,找到这个出现一次的元素。
题解
相同的数异或等于0,所以,所有数异或的结果就是这个只出现一次的数。
class Solution {
public:
int singleNumber(vector<int>& nums) {
int result=0;
for(auto i:nums)
result=result^i;
return result;
}
};