Leetcode 80

80. 删除有序数组中的重复项 II

solution : 双指针(有思路但还是很难写啊😒)

class Solution {
    public int removeDuplicates(int[] nums) {
        int len = nums.length;
        int slow= 2, fast = 2;
        if(len <= 2){
            return len;
        }
        while(fast<len){
            if(nums[slow - 2]!=nums[fast]){
                nums[slow] = nums[fast];
                ++slow;
            }
            ++fast;
        }
        return slow;
    }
}