LeetCode 26. 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 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
"""
i = 0
while i< len(nums)-1:
if nums[i] == nums[i+1]:
del nums[i+1]
else:
i = i+1
return len(nums)

使用set()方法

class Solution(object):
def removeDuplicates(self, nums):
"""
:type nums: List[int]
:rtype: int
"""
temp = set(nums)
nums[:] = [i for i in temp]
nums.sort()
return len(nums)