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.

 

也是一道水题。唯一值得注意的可能是O(1)空间复杂的去重思想。通过设立索引来指向当前访问位置，从而实现数字的替换插入；

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