https://leetcode-cn.com/problems/shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-lcof/solution/shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-by-leetcode/
class Solution {
public:
vector<int> singleNumbers(vector<int>& nums) {
int ret = 0;//必须初始化
for (int n : nums)
ret ^= n;
int div = 1;
while ((div & ret) == 0)
div <<= 1;
int a = 0, b = 0;
for (int n : nums)
if (div & n)
a ^= n;
else
b ^= n;
return vector<int>{a, b};
}
};
https://leetcode-cn.com/problems/shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-ii-lcof/solution/3chong-jie-fa-ji-jian-cdai-ma-by-fengzil-fmlr/
法一:排序
class Solution {
public:
int singleNumber(vector<int>& nums) {
int n = nums.size();
sort(nums.begin(), nums.end());
//只有三种情况
if (nums[0] != nums[1]) return nums[0];
if (nums[n - 2] != nums[n - 1]) return nums[n - 1];
for (int i = 1;i < n;i++){
if (nums[i] != nums[i-1] && nums[i] != nums[i+1])
return nums[i];
}
return 0;
}
};
class Solution {
public:
int singleNumber(vector<int>& nums) {
sort(nums.begin(), nums.end());
for (int i = 0; i < (int)nums.size() - 2; i += 3)
if (nums[i] != nums[i + 2]) return nums[i];
return nums.back();
}
};
法二:哈希表
class Solution {
public:
int singleNumber(vector<int>& nums) {
unordered_map<int, int> dict;
for (auto &i : nums) ++dict[i];
for (auto &[k, v] : dict)
if (v == 1) return k;
return 0;
}
};
法三:位运算
class Solution {
public:
int singleNumber(vector<int>& nums) {
int ans=0;
for(int i=0;i<32;++i)//计算二进制的每一位
{
int sum=0;
for(int& num : nums)//计算每个数在二进制的同一位上的贡献
sum+=(num>>i)&1;
if(sum%3)//出现1,则要还原到原位
ans|=1<<i;
}
return ans;
}
};