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.

---

思路：

• 用len保存当前没有重复的vector长度，当下一个元素月当前的nums[len]不同时，就把此元素赋给nums[len+1]

---

C++代码如下：

int removeDuplicates(vector<int>& nums) {
    if (nums.size() <= 1)
        return nums.size();
    int len = 0;
    for (int i = 1; i < nums.size(); i++)
    {
        if (nums[len] != nums[i])
        {
            nums[++len] = nums[i];
        }

    }
    return len + 1;
}