class Solution {
public:
vector<int> singleNumber(vector<int>& nums) {
vector<int>single;
sort(nums.begin(),nums.end());
int i=0;
while(i<nums.size()-1){
if(nums[i]==nums[i+1]){i=i+2;}
else{single.push_back(nums[i]);
//single.push_back(nums[i+1]);
i++;
}
}
if(nums[nums.size()-1]!=nums[nums.size()-2]){ single.push_back(nums[nums.size()-1]);}
return single;
}
};
思路:
将数组排序,然后从0~size-1的位置进行循环,最后位置的单独处理;