题目: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.
保存当前位置为key,如果下一个数与key相同,则++,如果不相同,则把这个key放到数组中,同时把这数作为key.
代码:
int removeDuplicates(int* nums, int numsSize) {
int first=0;
int key=nums[0];
if(numsSize==0)return 0;
for(int i=0;i<numsSize;i++)
{
if(nums[i] != key)
{
nums[first++]=key;
key=nums[i];
}
}
nums[first++]=key;
return first;
}