面试经典 150 题 （三）

解
快慢指针

class Solution {
    public int removeDuplicates(int[] nums) {
        int pre = nums[0];
        int place = 1;
        for (int i = 1; i < nums.length; i++){
            if (nums[i] == pre){
                continue;
            }else{
                nums[place++] = nums[i];
                pre = nums[i];
            }
        }
        return place;
    }
}