利用双指针的方法:
class Solution {
public:
int removeDuplicates(vector<int>& nums) {
if(nums.size()==0)
return 0;
int slow=0;
int fast=0;
for(fast=0;fast<nums.size()-1;fast++)
{
if(nums[fast]!=nums[fast+1])
{
nums[++slow]=nums[fast+1