class Solution {
public:
int removeDuplicates(vector<int>& nums) {
if(nums.size() == 0) return 0;
stack<int> s;
sort(nums.begin(),nums.end());
s.push(nums[0]);
for(auto iter = nums.begin(); iter != nums.end();iter++ ){
if(*iter !=s.top()){
s.push(*iter);
}
}
nums.clear();
while(!s.empty()){
nums.push_back(s.top());
s.pop();
}
reverse(nums.begin(),nums.end());
return nums.size();
}
};
删除重复先排序,再删除,用stack 比较删除比用 unqiue快很多,值得深入思考