leetcode 26 Remove Duplicates from Sorted Array

ghoshorn

于 2015-04-13 15:14:01 发布

阅读量474

点赞数

CC 4.0 BY-SA版权

分类专栏： leetcode

本文链接：https://blog.youkuaiyun.com/ghoshorn/article/details/45026105

leetcode 专栏收录该内容

28 篇文章

订阅专栏

本文介绍了一种方法，在不使用额外空间的情况下，去除有序数组中的重复元素，并返回新的数组长度。通过迭代和条件判断，实现对数组元素的高效处理。

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

Remove Duplicates from Sorted Array

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 A = [1,1,2],

Your function should return length = 2, and A is now [1,2].

class Solution1: 
    # @param a list of integers
    # @return an integer
    def removeDuplicates(self, A):
        l=len(A)
        i=0
        while i<len(A)-1:
            if A[i]==A[i+1]:
                del A[i+1]
            else:
                i+=1
        return len(A)

然后提示del, pop(), or remove() are not allowed.

class Solution2:
    # @param a list of integers
    # @return an integer
    def removeDuplicates(self, A):
        l=len(A)
        i=0
        while i<l-1:
            if A[i]==A[i+1]:
                for j in range(i+1,l-1):
                    A[j]=A[j+1]
                l-=1
            else:
                i+=1
        return l

大数据会超时。。。

再改

class Solution:
    # @param a list of integers
    # @return an integer
    def removeDuplicates(self, A):
        l=ll=len(A)
        print l
        i=0
        j=1
        while j<ll:
            if A[i]==A[j]:
                j+=1
                l-=1
            else:
                A[i+1]=A[j]
                i+=1
                j+=1
        return l