Remove Duplicates from Sorted Array

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

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

0 ·

CC 4.0 BY-SA版权

LeetCode 专栏收录该内容

31 篇文章

订阅专栏

本文介绍了一个C++程序，该程序可以就地移除已排序数组中的重复元素，并返回新的长度。示例中给出的输入数组为[1,1,2]，经过处理后返回的长度为2，且数组变为[1,2]。程序通过比较相邻元素并覆盖原数组来实现这一目标。

摘要生成于 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 A = [1,1,2],

Your function should return length = 2, and A is now [1,2].

class Solution {
public:
    int removeDuplicates(int A[], int n) {
        int duplicate = 0;
        for(int i = 0; i < n; i++){
            while(A[i] == A[i + 1]){
                i++;
            }
            A[duplicate] = A[i];
            duplicate++;
        }
        if(duplicate < n - 1){
            A[duplicate] = '/0';
        }
        return duplicate;
    }
};