本文共 716 字，大约阅读时间需要 2 分钟。

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.

没什么难度，此题主要注意节省空间。代码如下：

public class Solution {
       public int removeDuplicates(int[] nums) {        int length = 1;        for(int i = 1; i < nums.length; i++) {            if(nums[i] > nums[i - 1]) {                nums[length++] = nums[i];            }        }        return length;    }}

转载地址：http://jnjgj.baihongyu.com/