https://leetcode.com/problems/single-number/
题目描述
Given a non-empty 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?
Example 1:
Input: [2,2,1] Output: 1
Example 2:
Input: [4,1,2,1,2] Output: 4
解题思路
任何一个数异或自身结果为0, 即a^a=0. 所以只要把数组中的所有元素进行异或运算,出现两次的数字异或结果0, 0与另外一个出现一次的数字异或,结果是数字本事即a^0=a;
Solution
class Solution {
public:
int singleNumber(vector<int>& nums) {
int res = 0;
for (int item: nums)
res ^= item;
return res;
}
};