力扣数组刷题记录(80. 删除有序数组中的重复项 II)

class Solution {
public:
    int removeDuplicates(vector<int>& nums) {
    int slow=2,fast=2;
    int n=nums.size();
    if(n<=2){
        return n;
    }
    while(fast<n){
        if(nums[slow-2]!=nums[fast]){
            nums[slow]=nums[fast];
            slow++;
        }
        fast++;
    }
    return slow;

    }
};