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 1:

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.

Example 2:

Given nums = [0,0,1,1,1,2,2,3,3,4],

Your function should return length = 5, with the first five elements of nums being modified to 0, 1, 2, 3, and 4 respectively.

It doesn't matter what values are set beyond the returned length.

Clarification:

Confused why the returned value is an integer but your answer is an array?

Note that the input array is passed in by reference, which means modification to the input array will be known to the caller as well.

Internally you can think of this:

// nums is passed in by reference. (i.e., without making a copy)
int len = removeDuplicates(nums);

// any modification to nums in your function would be known by the caller.
// using the length returned by your function, it prints the first len elements.
for (int i = 0; i < len; i++) {
    print(nums[i]);
}

思路

首先将不重复的元素移动到前k个位置，然后对前k个元素进行排序，返回k。

选取不重复元素

两个指针k、i首先指向最后一个元素，i用于遍历数组，k用于指向最后一个不重复的元素。
当i向前移动， 发现一个重复元素，则将k指向的元素与之交换，k加1。遍历结束后，k指向最后一个不重复的元素。时间复杂度为O(n)。

排序

数组排序， 时间复杂度为O(Klog(K))。

python

class Solution(object):
    def removeDuplicates(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        if len(nums) < 2: return len(nums)
        k = len(nums) - 1
        i = len(nums) - 1
        while i > 0:
            if nums[i-1] == nums[i]: 
                nums[i] = nums[k]
                k -= 1
            i -= 1
        a[:k + 1] =sorted(a[:k + 1])
        return k + 1