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.
定义comp为上一个不一样的数,然后每个数与这个比较,由于是sorted,后面的数只能大于comp。
public class Solution {
public int removeDuplicates(int[] nums) {
int len=nums.length;
if(len==0) return 0;
int index=1;
int count=1;
int comp=nums[0];
while(index<len)
{
if(nums[index]>comp)
{
comp=nums[index];
nums[count]=comp;
count++;
comp=nums[index];
}
index++;
}
return count;
}
}