# LeetCode OJ 系列之26 Remove Duplicates from Sorted Array --Python

Problem:

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
"""
if len(nums) == 0: return len(nums)
last = nums[-1]
for index in range(len(nums)-2,-1,-1):
if last == nums[index]: del nums[index]
else: last = nums[index]
return len(nums)
Note:

class Solution(object):
def removeDuplicates(self, nums):
"""
:type nums: List[int]
:rtype: int
"""
return len(set(nums))

• 本文已收录于以下专栏：

举报原因： 您举报文章：LeetCode OJ 系列之26 Remove Duplicates from Sorted Array --Python 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)