JS算法题解：原地删除排序数组重复项

const removeDuplicates = nums => {
    let count = 0;
    const n = nums.length;
    for(let i = 1; i < n; i++){
        if(nums[i] != nums[i-1]){
            nums[i-count] = nums[i]
        }else{
            count++;
        }
    }
    return n-count;
};

const removeDuplicates = nums => {
    let j = 0;
    const n = nums.length;
    for(let i = 1; i < n; i++){
        if(nums[i]!= nums[i-1]){
            j++;
            nums[j] = nums[i];
        }
    }
    return j+1;
};