LeetCode 80 删除排序数组中的重复项

class Solution {
public:
    int removeDuplicates(vector<int>& nums) {
        if(nums.size()==0)return 0;
        int i=0;
        int j=1;
        int temp=0;
        for(;j!= nums.size();j++){
            if(nums[i]!=nums[j]){
                i++;
                nums[i]=nums[j];
                temp=0;
            }
            else{
                temp++;
                if(temp>1){}
                else{ i++;nums[i]=nums[j];}
                
            }
        }
        
       return i+1;
    }
};

思路：

用两个指针，将多余重复的项被覆盖即可；