leetcode 26 Remove Duplicates from Sorted Array

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