LeetCode: Remove Duplicates from Sorted Array

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.

题目解析：用一个变量currid记录当前更新的位置，每次遇到不重复的元素，加1

int removeDuplicates(int* nums, int numsSize) {

if (numsSize <= 0) return numsSize;

int currid = 1;
for (int i = 1; i < numsSize; ++i) {
while(nums[i] == nums[currid - 1] && i < numsSize) {i++;}

if (i < numsSize) {
nums[currid] = nums[i];
currid++;
}
}

return currid;

}