leetcode 26 删除排序数组中重复的项

给定一个排序数组，你需要在 原地 删除重复出现的元素，使得每个元素只出现一次，返回移除后数组的新长度。

不要使用额外的数组空间，你必须在 原地 修改输入数组 并在使用 O(1) 额外空间的条件下完成。

Example 1:
Input: nums = [1,1,2]
Output: 2, nums = [1,2]
Explanation: 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 returned length.

Example 2:
Input: nums = [0,0,1,1,1,2,2,3,3,4]
Output: 5, nums = [0,1,2,3,4]
Explanation: Your function should return length = 5, with the first five elements of nums being modified to 0, 1, 2, 3, and 4 respectively. It doesn’t matter what values are set beyond the returned length.

链接：https://leetcode-cn.com/problems/remove-duplicates-from-sorted-array

class Solution {
public:
    int removeDuplicates(vector<int>& nums) 
    {
        if(nums.size() == 0)
        {
            return 0;
        }
        int index = 1;
        auto itr = nums.begin();
        for(auto it = nums.begin()+1; it != nums.end(); it++)
        {
            if(*itr != *it)
            {
                itr++;
                index++;
            }
            *itr = *it;
        }
        return index;
    }
};