算法分析与设计课程——LeetCode刷题之Remove Duplicates from Sorted Array

版权声明：本文为博主原创文章，未经博主允许不得转载。 https://blog.csdn.net/m0_38041038/article/details/78994521

题目：

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.

答案：

class Solution {
public:
   int removeDuplicates(vector<int>& nums) {
    int pos = 0;

    for (int i = 0; i < nums.size(); ++i) {
        if (i == 0 || nums[i] != nums[pos - 1])
            nums[pos++] = nums[i];
    }

    return pos;
}
};