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.
给定一个有序数组和一个元素值，删除数组中给定的元素值，并返回新的数组长度。

##代码

int removeDuplicates(int* nums, int numsSize) 
{
	//判空，容易忽略的问题
	if (0 == numsSize)
	{
		return 0;
	}
    int length = 1;
    for (int index = 1; index < numsSize; index++)
    {
    	int preValue = nums[length-1];
    	int curValue = nums[index];
    	if (preValue != curValue)
    	{
    		nums[length++] = curValue;
    	}
    }
    return length;
}

转载于:https://my.oschina.net/applepeel/blog/994526