Leedcode Remove Duplicates from Sorted Array Python 不用额外空间，在当前集合内去重

Leetcode 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.

---

题目大意：在当前集合下操作去重。集合的前几位是去重后的数字，余下的不影响AC。

一开始没有仔细读题，随意看了一眼，集合内去重。我想这不就是体现python脚本语言优势的时候吗。

length = len(set(nums))
nums = list(set(nums))
return length

就很迷，理论上来说上面这个代码也可以达到需求，我也在自己的编译器里试了试可以。 可能它要求“集合的前几位是去重后的数字”，没有要求删去多余的数字吧。

那就只能用指针一个一个循环，对比，写入了。
上代码。

cur是慢指针，作为被对比的那个。一旦发现后面那个不同，就把不同的数字写入，然后慢指针后移。 快指针也后移继续对比。

class Solution:
    def removeDuplicates(self, nums: List[int]) -> int:
        if not nums: return 0
        cur = 0
        for i in range(1,len(nums)):
            if nums[cur] != nums[i]:
                cur += 1
                nums[cur] = nums[i]
        return cur+1

完。
2020/04/16
疫情中的英国，
加油！