260. Single Number III

#include <algorithm>class Solution {public:    vector<int> singleNumber(vector<int>& nums) {        sort(nums.begin(),nums.end());        vector<int> singles;        for(auto a=nums.begin(); a!=nums.end();a++)        {            if(a==nums.begin()&&*a!=*(a+1)) singles.push_back(*a);            else if(a==nums.end()-1&&*a!=*(a-1)) singles.push_back(*a);            else if(a!=nums.begin()&&a!=nums.end()-1&&*a!=*(a+1)&&*a!=*(a-1))                singles.push_back(*a);        }        return singles;    }};