leetcode:26 Remove Duplicates from Sorted Array－每日编程第二十三题

Remove Duplicates from Sorted Array

Total Accepted: 98385 Total Submissions: 307605 Difficulty: Easy

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.

思路：

1).注意nums.erase(it)会自增迭代器就好。

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