Leetcode(13)

https://leetcode.com/problems/remove-duplicates-from-sorted-array/#/description

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.

Solution:

这道题比较简单，因为已经排好序了，遍历数组，只要不断地比较当前位置的元素与上一个元素是否相同，如果不同，则向前移动。

int RemoveDuplicatesfromSortedArray::removeDuplicates(std::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];        }    }    return index;}