Remove Duplicates from Sorted Array

标签：c语言   leetcode   

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 i,j;
	if(numsSize==0)
		return 0;
	i=0;
	for (j=1; j<numsSize; j++)
	{
		if (nums[j]!=nums[i])
		{
			nums[++i]=nums[j];
		}
	}
	return i+1;
}

Remove Duplicates from Sorted Array

标签：c语言   leetcode   

原文地址：http://blog.csdn.net/lsh_2013/article/details/45699935