[leetcode]26. Remove Duplicates from Sorted Array

Given a sorted array, remove the duplicates in place such that each element appear only once and return 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], you 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) {
if(numsSize < 2)
return numsSize;

int num = 1;
for(int i=1; i<numsSize; i++)
{
if(nums[i]!=nums[num-1])
{
nums[num] = nums[i];
num++;
}
}
return num;
}