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.

思路：遍历，后者跟前面不一样的从头开始存，公用数据结构

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