线性表--26. Remove Duplicates from Sorted Array

最新推荐文章于 2022-02-23 11:25:43 发布

chenxy258

最新推荐文章于 2022-02-23 11:25:43 发布

阅读量256

点赞数

CC 4.0 BY-SA版权

分类专栏：算法设计与分析作业

本文链接：https://blog.youkuaiyun.com/chenxy258/article/details/79049495

算法设计与分析作业专栏收录该内容

23 篇文章

订阅专栏

本文介绍了一种在不使用额外空间的情况下从已排序数组中去除重复元素的方法，并确保每个元素只出现一次。通过修改输入数组本身来实现，示例中使用了C++代码展示如何将数组中的重复项去除并返回新长度。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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

Example

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.

Analysis

class Solution {
public:
    int removeDuplicates(vector<int>& nums) {

        if(nums.empty()) return 0;

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