Remove Duplicates from Sorted Array

最新推荐文章于 2022-04-06 16:22:53 发布

原创最新推荐文章于 2022-04-06 16:22:53 发布 · 578 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#LeeCode Duplicates

算法|ACM 专栏收录该内容

28 篇文章

订阅专栏

本文介绍了一种在不使用额外空间的情况下从已排序数组中去除重复元素的方法，确保每个元素只出现一次，并返回新长度。例如，对于输入数组 [1,1,2]，处理后应返回长度为2，且数组变为 [1,2]。

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

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