leetcode26. [Array]Remove Duplicates from Sorted Array

最新推荐文章于 2023-10-30 13:36:28 发布

ep_mashiro

最新推荐文章于 2023-10-30 13:36:28 发布

阅读量230

点赞数

CC 4.0 BY-SA版权

分类专栏： python leetcode

本文链接：https://blog.youkuaiyun.com/tinkle181129/article/details/50822013

python 同时被 2 个专栏收录

152 篇文章

订阅专栏

leetcode

136 篇文章

订阅专栏

本文介绍了一个简单的算法，用于从已排序的数组中去除重复元素，确保每个元素只出现一次，并返回新的长度。该算法不使用额外的空间，符合常数内存的要求。

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

Total Accepted: 117053 Total Submissions: 354699 Difficulty: Easy
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 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 new length.

class Solution(object):
    def removeDuplicates(self, nums):
        j=1;count=0
        if not len(nums):
            return 0
        tmp=nums[0]
        for i in range(1,len(nums)):
            if nums[i]!=tmp:
                nums[j]=nums[i]
                j=j+1
                tmp=nums[i]
            else:
                count=count+1
        for i in range(count):
            nums.pop()
        return len(nums)