C语言 | Leetcode C语言题解之第136题只出现一次的数字

题目：

题解：

class Solution {
public:vector<int> singleNumbers(vector<int>& nums) {int eor = 0;for (int num:nums)eor ^= num;int rightOne = eor & (~eor + 1); // 提取出最右的1int onlyOne = 0;for (int cur : nums) {if ((cur & rightOne) != 0)onlyOne ^= cur;return vector<int>{onlyOne, eor^onlyOne};}
};