题目链接:https://leetcode.com/problems/single-number/
题面:
136. Single Number
Easy
251694FavoriteShare
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
题意:求唯一出现一次的数。
解题:利用偶数个异或抵消的性质,即可得到单独出现一次的数。
代码:
class Solution {
public:
int singleNumber(vector<int>& nums) {
int ans=0;
for(int i=0;i<nums.size();i++)
ans^=nums[i];
return ans;
}
};