Remove Duplicates from Sorted Array

最新推荐文章于 2024-01-02 23:35:28 发布

原创最新推荐文章于 2024-01-02 23:35:28 发布 · 592 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode

leetcode 专栏收录该内容

13 篇文章

订阅专栏

本文介绍了一个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 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) {
        for( int i = 1; i < n; ++i ) {
            if( A[i] == A[i - 1] ) {
                for( int k = i; k < n; ++k ) {
                    A[k - 1] = A[k];
                }
                --n;
                --i;
            }
        }
        return n;
    }
};