26. Remove Duplicates from Sorted Array

原创于 2016-11-12 15:42:33 发布 · 147 阅读

0 ·

CC 4.0 BY-SA版权

leetcode代码笔记专栏收录该内容

82 篇文章

订阅专栏

本文介绍了一个C++程序，该程序可以有效地去除已排序数组中的重复元素，并返回处理后的数组长度。此方法不需要额外分配内存空间，完全在原数组中进行操作。

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

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) {
        if(nums.size() ==1)
        return 1;
       int cnt = 0;
        for(int i=0;i<nums.size();){
        nums[cnt++] = nums[i];
        while(i<nums.size()-1 && nums[i]==nums[i+1]){
            i++;
        }
        
        i++;
    }
    return cnt;
    }
};