【数组 删除排序数组中的重复项】双指针

leetcode26

class Solution {
    public int removeDuplicates(int[] nums) {
        int len = 0;
        //表首不需要判断
        for(int i = 1; i < nums.length; i++){
            if(nums[len] != nums[i]){
                len++;
                nums[len] = nums[i];               
            }           
        }
        return len+1;
    }
}

leetcode80
详解

class Solution {
    public int removeDuplicates(int[] nums) {
        if(nums == null)
        return 0;
        if(nums.length <= 2)
        return nums.length;
        //前两个数不需要检验
        int len = 2 -1;
        for(int i = 2;i < nums.length;i++){
            if(nums[len - 2 +1] != nums[i]){
                len++;
                nums[len] = nums[i];
            }
        }
        return len + 1;

    }
}