题目:
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]
.
链接:https://oj.leetcode.com/problems/remove-duplicates-from-sorted-array/
描述:删除有序数组中的重复元素
solution by python:
class Solution:
# @param a list of integers
# @return an integer
def removeDuplicates(self, A):
if len(A) < 2: return len(A)
idx = 0
for i in range(len(A)):
if A[i] == A[idx]: continue
A[idx+1] = A[i]
idx += 1
return idx+1