【Leetcode】Remove Duplicates from Sorted Array

最新推荐文章于 2025-09-11 19:19:55 发布

转载最新推荐文章于 2025-09-11 19:19:55 发布 · 143 阅读

文章标签：

#leetcode #java #array

本文提供了一个Java方法，用于处理已排序数组，移除重复元素，并返回数组的新长度。此方法不使用额外空间，仅通过迭代数组实现。

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

Java:

1. 水印人生：http://gongxuns.blogspot.com/2012/12/leetcoderemove-duplicates-from-sorted.html

public class Solution {
    public int removeDuplicates(int[] A) {
       if(A.length<=1) return A.length;
       int i=1,j=1;
       while(j<A.length)
       {
           if(A[j]>A[i-1])
           {
                A[i]=A[j];
               i++;
               j++;
           }
           else{
              j++;
           }
       }
       return i;
    }
}