/*
2017.10.7
LeetCode : RemoveDuplicates form Sort Array
*/
int removeDuplicates(int* nums, int numsSize) {
int k = 0, i;
if (numsSize == 0)
return numsSize;
for(i = 1; i < numsSize; i++){
if(nums[k] == nums[i]){
continue;
}else{
nums[++k] = nums[i];
}
}
return k+1;
}
原题链接