LeetCode (Remove Duplicates from Sorted Array)

最新推荐文章于 2022-04-06 16:22:53 发布

原创最新推荐文章于 2022-04-06 16:22:53 发布 · 136 阅读

0 ·

CC 4.0 BY-SA版权

C++ 专栏收录该内容

83 篇文章

订阅专栏

本文介绍了一个C++解决方案，用于在不使用额外空间的情况下从已排序数组中移除重复元素，并保持原有元素顺序不变。该方法返回处理后数组的新长度。

Problem:

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:

class Solution {
public:
    int removeDuplicates(vector<int>& nums) {
        if (nums.empty()) return 0;
        vector<int>::iterator it = nums.begin() + 1;
        while (it != nums.end()){
            if (*it == *(it - 1))
                nums.erase(it);
            else
                it++;
        }
        return nums.size();
    }
};