[LeetCode26]Remove Duplicates from Sorted Array

最新推荐文章于 2025-11-24 16:32:05 发布

原创最新推荐文章于 2025-11-24 16:32:05 发布 · 723 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode #array #数组

Leetcode 同时被 2 个专栏收录

287 篇文章

订阅专栏

LeetCode Questions

178 篇文章

订阅专栏

本文介绍了一个算法，用于在不使用额外空间的情况下，去除已排序数组中的重复元素，并返回处理后的数组长度。

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].

Analysis:

two pointers scan. if A[count]==A[index] continue, else A[++count] = A[index]

Java

public int removeDuplicates(int[] A) {
        // IMPORTANT: Please reset any member data you declared, as
        // the same Solution instance will be reused for each test case.
        int count = 0;
        if(A.length <= 1)
        	return A.length;
        for(int i=1;i<A.length;i++){
        	if(A[i] != A[count])
        		A[++count] = A[i];
        }
        return count+1;
    }

c++

int removeDuplicates(int A[], int n) {
        if(n == 0) return 0;
        int index = 0;
        for(int i=0; i<n; i++){
            if(A[index] == A[i]){
                continue;
            }
            else{
                A[++index] = A[i];
            }
        }
        return index+1;
    }