LeetCode *** 26. 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型的pre量来对比是否有重复元素。

代码：

class Solution {
public:
int removeDuplicates(vector<int>& nums) {
if(nums.empty())return 0;
int length=1;
int pre=nums[0];

vector<int>::iterator it=nums.begin();

it++;
while(it!=nums.end()){
if(pre==*it){
it=nums.erase(it);
}
else{
length++;
pre=*it;
++it;
}
}

return length;
}
};