leetcode 26. Remove Duplicates from Sorted Array

Given a sorted array nums, 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 by modifying the input array in-place with O(1) extra memory.

Example 1:
Given 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 returned length.
Example 2:
Given nums = [0,0,1,1,1,2,2,3,3,4],
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.

题目的意思让你不开辟额外的数组空间，将原来的重复数据删除掉（vector自带的erase就可以删除，删除之后要i--，因为后面的标号都变了），返回无重复的长度。

 

    int removeDuplicates(vector<int>& nums) {
        if(nums.empty() ==true)
        {
            return 0;
        }
        int m = nums[0];
        int s = 1;
        for (int i = 1 ; i < nums.size() ; i++)
        {
            if (m != nums[i])
            {
                m = nums[i];
                s++;
            }
            else
            {
                nums.erase(nums.begin()+i);
                i--;
            }
        }
        return s;
    }