26. Remove Duplicates from Sorted Array

26. Remove Duplicates from Sorted Array
Difficulty: Easy

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.

给定一个已排序的数组，移除其中的副本元素使每个元素值只出现一次，返回新的数组长度。
空间复杂度要求为O(1)。
如：输入nums=[1,1,2]，应该返回length=2，且数组nums的前两个元素分别为1,2，length长度后面的元素值可以为任意。

int removeDuplicates(int* nums, int numsSize) {
    int i,invalidNum,sub;
    int validLen;

    sub=nums[0];   //临时变量记录数组的每一个新出现的元素
    invalidNum=0;   //失效的点数
    for(i=1;i<numsSize;i++)
    {
        if(nums[i]==sub)
        {
            invalidNum++;
        }
        else
        {
            sub=nums[i];
            nums[i-invalidNum]=nums[i];
        }
    }
    validLen=numsSize-invalidNum;   //返回有效的数组长度
    return validLen;
}