原题
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 int RemoveDuplicates(int[] nums)
{
//nums have been sorted
if(nums.Length==0) return 0;
if(nums.Length==1) return 1;
int j=0; //指向不同元素的指针
for(int i=0; i<nums.Length; i++)
{
while(i+1<nums.Length && nums[i]==nums[i+1])
i++;
if(i+1<nums.Length)
{
j++;
if(j<i+1) //[j-1,i]间元素相等
nums[j] = nums[i+1];//
}
else
j++;
}
return j;
}