题目
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.
分析
去除排序数组中的重复数字，并返回新的长度。由于已经排序了，所以挨个分析数字，出现相同的就忽略，不同的话，重新赋值到数组适当位置即可。
int removeDuplicates(int* nums, int numsSize) {
int length=1;
for(int i=1;i<numsSize;i++)
{
if(nums[i]!=nums[length-1])
{
nums[length]=nums[i];
length++;
}
}
if(numsSize==0)length=0;
return length;
}
