26. Remove Duplicates from Sorted Array

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

wdlsjdl2

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

阅读量152

点赞数

CC 4.0 BY-SA版权

本文链接：https://blog.youkuaiyun.com/wdlsjdl2/article/details/51942772

本文介绍了一种高效的方法来去除已排序数组中的重复元素，并返回处理后的新长度。该方法不需要额外分配数组空间，仅使用常数级别的内存操作即可完成任务。

摘要生成于 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.

因为只已经排序了的，遇到当前位置元素和前面一个位置相同，直接覆盖写到数组的前面，已经排序保证覆盖不会漏掉元素。

 public int removeDuplicates(int A[], int n) {
        if(n < 2) return n;
        int cnt = 1;
        for(int i = 1; i < n; ++i) 
            if(A[i] != A[i-1]) A[cnt++] = A[i];
        return cnt;
    }