【LeetCode】260. Single Number III（C++）

Given an array of numbers nums, in which exactly two elements appear only once and all the other elements appear exactly twice. Find the two elements that appear only once.

For example:

Given nums = [1, 2, 1, 3, 2, 5], return [3, 5].

Note:

1. The order of the result is not important. So in the above example, [5, 3] is also correct.
2. Your algorithm should run in linear runtime complexity. Could you implement it using only constant space complexity?

这道题我是用set容器来解决的，但是效率不高

代码1：（set）

class Solution {
public:
    vector<int> singleNumber(vector<int>& nums) {
        set<int> s;
        for(int i=0; i<nums.size(); i++){
            if(s.find(nums[i])!=s.end()){
                s.erase(nums[i]);
            }
            else
                s.insert(nums[i]);
        }
        vector<int> v;
        auto itel=s.begin();  
        v.push_back(*itel);  
        v.push_back(*(++itel)); 
        return v;
    }
};

其实这道题是一道与位操作有关的题目。

下面的程序是LeetCode中给出的sample submission

代码2：（位操作）

Back to problem
× Close
sample 13 ms submission
class Solution {
public:
    vector<int> singleNumber(vector<int>& nums) {
        int mask = 0;
        for (int n : nums) {
            mask ^= n;
        }
        
        mask &= -mask;
        vector<int> res = {0,0};
        
        for (int n : nums ) {
            if ((n & mask) == 0) {
                res[0] ^= n;
            } else {
                res[1] ^= n ;
            }
        }
        
        return res;
        
        
        
    }
};
Copyright © 2018 LeetCode Contact Us  |  Jobs  |  Frequently Asked Questions  |  Terms of Service  |  Privacy Policy       United States