这道题没什么难度,就这样吧。也没有必要刻意去简化代码。注意开头判空
class Solution
{
public:
int removeDuplicates(vector<int> &nums)
{
if (nums.empty())
return 0;
int p = 0, pmove = 0;
for (; pmove < nums.size(); ++pmove)
{
if (nums[pmove] != nums[p])
nums[++p] = nums[pmove];
}
return p + 1;
}
};