LeetCode 26. Remove Duplicates from Sorted Array

最新推荐文章于 2024-12-06 07:02:43 发布

Easyin

最新推荐文章于 2024-12-06 07:02:43 发布

阅读量104

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode

本文链接：https://blog.youkuaiyun.com/weixin_41790755/article/details/80099479

LeetCode 专栏收录该内容

4 篇文章

订阅专栏

本文介绍了一个在不使用额外空间的情况下，对已排序数组进行去重的方法，并提供了Python实现示例。该方法通过遍历数组并移除重复元素来确保每个元素只出现一次。

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.

解题思路：

从数组开头向后遍历，若遇到重复则remove该元素。

Python代码：

class Solution:
    def removeDuplicates(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        i = 0
        while i < len(nums)-1:
            if nums[i] == nums[i+1]:
                nums.remove(nums[i])
            else:
                i += 1
        return len(nums)