【leetcode】删除排序数组中的重复项

int removeDuplicates(int* nums, int numsSize){
    if (!numsSize) return 0;
    int i,j=1;
    for (i=1; i<numsSize; i++)
    {
        if (nums[i] != nums[i-1]) nums[j++] = nums[i];
    }
    return j;
}