【Question】
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.
方法一:通过vector::iterator iter 叠加器,遍历发现相同便删除
class Solution {
public:
int removeDuplicates(vector<int>& nums)
{
if (nums.size()==0) return 0;
vector<int> temp;
vector<int>::iterator ittmp;
for(vector<int>::iterator iter=(nums.begin());iter!=(nums.end()-1);)
{
ittmp = iter;
if(*ittmp==*(iter+1))
{iter=nums.erase(iter);}
else iter++;
}
return nums.size();
}
};