Remove Duplicates from Sorted Arrays

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.
这是leetcode上的一道简单的题，难度不大，大致意思是，提供一个排序好的数组，写一个函数，要求删除有重复的数，返回一个新的长度，打印出来的新数组是不重复的，比如：[1,1,2]，返回长度2，打印出数组前两个，1和2。
下面是我的思路：

int removeDuplicates(int* nums, int numsSize) {
    int i,j,length = 0;   //length记录重复的个数
    for(i = 1,j = 0;i < numsSize;i++)
    {
        if(nums[j] < nums[i])
            nums[++j] = nums[i];
        else
        length++;
    }
    return numsSize - length;
}

这个算法的关键在循环内部，题目要求打印数组的前几个，不在乎数组的后面几个，我们只需将不重复的数复制到前面即可。此算法的时间复杂度为o(n),经测试运行时间为12ms。