L2：08 - Remove Duplicates from Sorted Array I, II

最新推荐文章于 2024-10-03 16:38:42 发布

sunliuxun

最新推荐文章于 2024-10-03 16:38:42 发布

阅读量315

点赞数

分类专栏： L2：BinarySearch到SortedArray

L2：BinarySearch到SortedArray 专栏收录该内容

11 篇文章

订阅专栏

本文介绍了一种在不使用额外空间的情况下从有序数组中去除重复元素的方法，通过一个示例程序展示了如何仅利用常数内存实现该功能。具体地，对于输入数组 [1,1,2]，经过处理后数组变为 [1,2] 并返回新长度 2。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

https://oj.leetcode.com/problems/remove-duplicates-from-sorted-array/

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

/**
 * Copyright: NineChapter
 * - Algorithm Course, Mock Interview, Interview Questions
 * - More details on: http://www.ninechapter.com/
 */

public class Solution {
    public int removeDuplicates(int[] A) {
        if (A == null || A.length == 0) {
            return 0;
        }
        
        int size = 0;
        for (int i = 0; i < A.length; i++) {
            if (A[i] != A[size]) {
                A[++size] = A[i];
            }
        }
        return size + 1;
    }
}

https://oj.leetcode.com/problems/remove-duplicates-from-sorted-array-ii/