LeetCode - 26: Remove Duplicates from Sorted Array

26、Remove Duplicates from Sorted Array

Given a sorted array nums, 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 by modifying the input array in-place with O(1) extra memory.

Example:

Given 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 returned length.

Solution-1 - Python:

def removeDuplicates(self, nums):
    """
    :type nums: List[int]
    :rtype: int
    """
    nums[:] = list(set(nums))
    nums.sort()
    return len(nums)

Solution-2 - Python:

#!/usr/bin/env python
# -*- coding = utf-8 -*-

"""
 @ Create Time: 2018/4/28
 @ Author: songpo.zhang
 @ Target:
"""

def removeDuplicates(nums):
    n = 0
    for i in range(1, len(nums)):
        if nums[n] != nums[i]:
            n += 1
            nums[n] = nums[i]
    return n + 1

nums = [1,1,1,2]
print((removeDuplicates(nums)))

不知道具体什么原因，在leetcode上提交时，第二种解法总是报错……