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.
这题跟27. Remove Element和283. Move Zeroes都有相似,不过,有两点需要注意:一是要判断数组长度是否为0,而是要注意如果不为零,返回的长度最少是1,之前的题是全去除,这道是留一个。代码如下:
public class Solution {
public int removeDuplicates(int[] nums) {
if (nums.length < 2) {
return nums.length;
}
int val = nums[0], n = 1;
for (int i = 1; i < nums.length; i++) {
if (nums[i] != val) {
nums[n++] = nums[i];
val = nums[i];
}
}
return n;
}
}