26. 删除有序数组中的重复项 - 力扣(LeetCode)
int removeDuplicates(int* nums, int numsSize)
{
int i = 0;
int j = 0;
while(numsSize--)
{
if(nums[i] != nums[j])
{
++i;
nums[i] = nums[j];
++j;
}
else ++j;
}
return i + 1;
}