Remove Duplicates from Sorted Array

Given a sorted array, remove the duplicates in place such that each element appear only once and return the new length.

Do not allocate extra space for another array, you must do this in place with constant memory.

For example,
Given input array nums = [1,1,2],

Your function should return length = 2, with the first two elements of nums being 1 and 2 respectively. It doesn't matter what you leave beyond the new length.

Show Tags

Have you met this question in a real interview

思路就是：遇到重复的元素，就继续向后循环，直到出现不重复的，才算一个新的

public class Solution {
    public int removeDuplicates(int[] nums) {
        if(nums==null||nums.length==0) return 0;
        if(nums.length==1) return 1;
        //count用来计算移除重复元素后数组的长度
        int count = 1;
     
        for(int i=0;i<nums.length-1;i++){
            if(nums[i+1]!=nums[i]){
                nums[count++] = nums[i+1];
            }
        }
        return count;
    }
}