[220206] Remove Duplicates from Sorted Array ll

最新推荐文章于 2024-09-09 23:28:21 发布

熊怪要变码农啦

最新推荐文章于 2024-09-09 23:28:21 发布

阅读量512

点赞数

分类专栏： # LeetCode Daily 文章标签： python pycharm leetcode 数据结构算法

本文链接：https://blog.csdn.net/yzh3558/article/details/122803810

版权

LeetCode Daily 专栏收录该内容

36 篇文章 0 订阅

订阅专栏

本文介绍如何使用Python实现一个解决方案，通过in-place方法去除排序数组中每个元素最多出现两次的重复项，同时保持元素相对顺序。主要讲解了Solution类中的removeDuplicates函数的工作原理。

摘要由CSDN通过智能技术生成

Given an integer array nums sorted in non-decreasing order, remove some duplicates in-place such that each unique element appears at most twice. The relative order of the elements should be kept the same.

Since it is impossible to change the length of the array in some languages, you must instead have the result be placed in the first part of the array nums. More formally, if there are k elements after removing the duplicates, then the first kelements of nums should hold the final result. It does not matter what you leave beyond the first k elements.

Return k after placing the final result in the first k slots of nums.

Do not allocate extra space for another array. You must do this by modifying the input array in-place with O(1) extra memory.

class Solution:
    def removeDuplicates(self, nums):
        
        # length < 3 则不存在多余的数
        if len(nums) < 3:
            return len(nums)
        
        # i: 指向需要被替换的位置
        # j: 检测每一个数是否为多余的
        i, j = 2, 2
        
        while j < len(nums):
            if nums[j] > nums[i - 2]:
                nums[i] = nums[j]
                i += 1
            j += 1

        return i