LeetCode Remove Duplicates from Sorted Array

最新推荐文章于 2025-12-20 22:59:04 发布

原创最新推荐文章于 2025-12-20 22:59:04 发布 · 191 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode

leetcode 专栏收录该内容

124 篇文章

订阅专栏

本文介绍了一个C++解决方案，用于在不使用额外空间的情况下从已排序数组中移除重复元素，并返回新长度。通过遍历数组并仅在找到不同元素时进行更新，确保了常数内存消耗。

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.

思路感觉没啥可以说的。

代码如下：

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