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.

这个题比较简单，先遍历，有重复的直接删除，注意这里删除用erase，为防止迭代器失效，返回删除节点的下一个节点，用迭代器保存一下。

class Solution {
public:
    int removeDuplicates(vector<int>& nums) {
        if(nums.size() <= 1)
            return nums.size();
        //vector<int>::iterator iteaftera;
        for(vector<int>::iterator ite=nums.begin()+1;ite != nums.end();){
            if(*(ite-1) == *ite){
                ite = nums.erase(ite);
            }
            else
                ++ite;
        }
        
        return nums.size();
    }
};