26 leetcode - Remove Duplicates from Sorted Array

忧桑的小兔子

于 2016-11-28 09:55:23 发布

阅读量177

点赞数

CC 4.0 BY-SA版权

文章标签： leetcode 移除重复元素

本文链接：https://blog.youkuaiyun.com/lis_12/article/details/53374216

算法专栏收录该内容

84 篇文章

订阅专栏

本文介绍了一个Python程序，该程序能够从已排序的数组中删除重复项，确保每个元素只出现一次，并返回新数组的有效长度。该算法在不使用额外内存的情况下实现了这一目标。

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

#!/usr/bin/python
# -*- coding: utf-8 -*-
'''
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):
        """
        :type nums: List[int]
        :rtype: int
        """
        length = len(nums)
        index = 0
        new_len = 0
        while index < length:
            if index > 0 and nums[index] == nums[index - 1]: #判断顺序不要乱换,不然会越界
                while index < length and nums[index] == nums[index - 1]:
                    index += 1
            else:
                nums[new_len] = nums[index]
                index += 1
                new_len += 1
        nuns = nums[:new_len]

        return new_len


if __name__ == "__main__":
    s = Solution()
    print s.removeDuplicates([1,1,1,2,2,2,2,22])