【leetcode】Single Number III-CSDN博客

本文介绍了一种线性时间复杂度的算法来找出数组中仅出现一次的两个元素，该算法使用了位操作并通过常数空间复杂度实现了高效查找。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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:

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

class Solution {
public:
    vector<int> singleNumber(vector<int>& nums) {
        int AxorB = 0;
        for (vector<int>::iterator it = nums.begin(); it != nums.end(); ++it)
        {
            AxorB = AxorB ^ (*it);
        }
        
        int A = 0;
        int B = 0;
        int mask = AxorB & (-AxorB);
        for (vector<int>::iterator it = nums.begin(); it != nums.end(); ++it)
        {
            if ((mask & (*it)) == 0)
                A = A ^ (*it);
            else
                B = B ^ (*it);
        }
        
        vector<int> result;
        result.push_back(A);
        result.push_back(B);
        return result;
    }
};

Personal Note：