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],

solution:

class Solution {public:    int removeDuplicates(vector<int>& nums) {        int sz = nums.size();        if(sz<=1) return sz;        auto p = nums.begin();        auto c = p+1;        while(c<nums.end()){            if(*p==*c){                c = nums.erase(c);            }            else{                p++;                c++;            }        }        return nums.size();    }};

心得：思路简单，运行速度慢 每次erase 后 nums.end()发生改变

运行速度：慢