26. Remove Duplicates from Sorted Array

steph_curry

于 2018-01-15 19:14:45 发布

阅读量85

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/steph_curry/article/details/79067798

版权

leetcode 专栏收录该内容

8 篇文章 0 订阅

订阅专栏

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 by modifying the input array in-place with O(1) extra memory.

Example:

Given 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(vector<int>& nums)
{
	
	int sum=1;
	vector<int>::iterator it=nums.begin();
	while(it!=nums.end()-1)
	{
		if(*it!=*(it+1))
		{
			sum++;
			it++;
		}
		else
		{
			it=nums.erase(it);
		}
			
	}
	return sum;

}