LeetCode(260) Single Number III

[code]class Solution {
public:
    vector<int> singleNumber(vector<int>& nums) {
        //make a filter
        int xory = 0;
        for(int i = 0; i < nums.size(); i++)
            xory ^= nums[i];
        int lowestBit = xory & (~(xory - 1));
        //fetch the one whose certain bit is not 0 
        int x = 0;
        for(int i = 0; i < nums.size(); i++) 
            if(nums[i] & lowestBit)
                x ^= nums[i];

        int y = xory ^ x;

        vector<int> result;
        result.push_back(x);
        result.push_back(y);

        return result;

    }
};