136 Single Number
链接:https://leetcode.com/problems/single-number/
问题描述:
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?
Hide Tags Hash Table Bit Manipulation
求一个数组中成单的元素,其他元素都是出现两次。可以便利一遍把元素放进map中,值作为key,value作为次数。最后取出value为1的元素就可以了。
class Solution {
public:
int singleNumber(vector<int>& nums)
{
map<int,int> hm;
for(int i=0;i<nums.size();i++)
hm[nums[i]]++;
map<int,int>::iterator it=hm.begin();
while(it!=hm.end())
{
if(it->second==1)
return it->first;
it++;
}
}
};
另外还有一种解法,一个数字与自己做异或操作等于0,所以让所有数字做异或操作,最后的结果就是那个singleNumber。
class Solution {
public:
int singleNumber(vector<int>& nums)
{
int result=0;
for(int i=0;i<nums.size();i++)
result^=nums[i];
return result;
}
};