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.

描述：删除一个有序数组中的重复元素

思路：当数组中只有一个元素的时候肯定不重复。两个指针index和i。index和i初始化1，而后对于i从1到nums.size()-1的数组元素，如果nums[i]==nums[i-1], 则只是应该保存一份就可以了，当nums[i]!=nums[i-1]时，nums[index++]=nums[i]。由于index<=i,所以不担心nums[index]会覆盖没有遍历的元素。

class Solution {
public:
    int removeDuplicates(vector<int>& nums) {
        if(nums.size()<2)
            return nums.size();
        int index=1;
        for(int i=1;i<nums.size();i++)
        {
            if(nums[i]!=nums[i-1])
                nums[index++]=nums[i];
        }
        nums.resize(index);
        return index;
    }
};