[LeetCode-26]-Remove Duplicates from Sorted Array(从有序数组中删除重复元素)

最新推荐文章于 2025-07-25 11:06:43 发布

原创最新推荐文章于 2025-07-25 11:06:43 发布 · 234 阅读

0 ·

CC 4.0 BY-SA版权

LeetCode 专栏收录该内容

9 篇文章

订阅专栏

博客围绕从有序数组中删除重复元素并返回数组长度的题目展开。题目要求在不额外分配数组空间的情况下，通过修改输入数组来完成，且额外内存为O(1)，难度为Easy。

文章目录

- 题目相关
- Solution

题目相关

【题目解读】
从有序数组中删除重复元素，并返回数组的长度。

【原题描述】原题链接
Given a sorted array nums, 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 by modifying the input array in-place with O(1) extra memory.

Example 1:

Given 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 returned length.

Example 2:
Given nums = [0,0,1,1,1,2,2,3,3,4],

Your function should return length = 5, with the first five elements of nums being modified to 0, 1, 2, 3, and 4 respectively.

It doesn't matter what values are set beyond the returned length.

【难度】Easy