Leetcode 26. Remove Duplicates from Sorted Array

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

Example:

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 new length.

题目链接：https://leetcode.com/problems/remove-duplicates-from-sorted-array/description/

题目大意：给定一个有序数组，只能利用O(1)的空间去除数组中重复元素并返回去重后数组的长度

解题思路：因为数组有序，相同数值一定相邻。指定下标 index 初始化为0，遍历数组，出现与index位置不同的数时，index 往后移一个位置，并把当前不同的数字复制到这个位置，以此类推，返回 index + 1 为数组长度。

代码：

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