[LeetCode] 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.

思路

数组是排过序的，k存储当前数组中不重复的元素的最大下标，初始为0，i从0开始遍历，如果该元素是唯一的，nums[k++] = nums[i]，否则i++直到出现不同的元素。

代码

public class Solution {
    public int removeDuplicates(int[] nums) {
        int k = 0;
        int len = nums.length;
        
        for(int i = 0; i < len; i++) {
            nums[k++] = nums[i];
            while(i < len - 1 && nums[i] == nums[i+1])
                i++;
        }
        return k;
    }
}