class Solution {
public:
vector<int> singleNumber(vector<int>& nums) {
if(nums.size()==2) return nums;
sort(nums.begin(),nums.end(),less<int>());
int i,count=0;
vector<int> res;
for(i=0;i<nums.size()-1;){
if(nums[i]!=nums[i+1]){
res.push_back(nums[i]);
i++;
count++;
if(count==2){
return res;
}
}else{
i+=2;
}
}
if(count==1){
res.push_back(nums[nums.size()-1]);
}
return res;
}
};