LeetCode26：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.

LeetCode：链接

变体：LeetCode80：Remove Duplicates from Sorted Array II

解题思路：因为数组是已经排序的，所以我们可以使用快慢指针。当快慢指针所指向的数字相同时，移动快指针，慢指针不动；当快慢指针所指向的数字不同时，把快指针所指的数字赋值给慢指针+1的位置，同时慢指针移动一位。知道快指针移动到数组末尾。最终返回的length就是慢指针加+1。

二刷：当你在用nums[slow] = nums[fast]时，已经把前一个数放在了slow上，所以和slow比较，就是和前一个数比较，非常巧妙！

class Solution(object):
    def removeDuplicates(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        if len(nums) <= 1:
            return len(nums)
        slow = 0
        for fast in range(1, len(nums)):
            if nums[fast] != nums[slow]:
                slow += 1
                nums[slow] = nums[fast]
        return slow + 1