class Solution
{
public:
int removeDuplicates(vector<int>& nums)
{
int n,lenght;
lenght=nums.size(); //获取数组长度
if(lenght==0)
return 0; //如果是空数组,退出
int count=0; //记录重复元素
for(int fast=1;fast<lenght;fast++)
{
if(nums[fast]==nums[fast-1])
count++;
else
{
nums[fast-count]=nums[fast];
}
}
return lenght-count;
}
};