【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.
在不使用额外内存的情况下删除重复元素，并返回操作后的array。

---

例子

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.

---

2019-06-07

刚开始的时候审错题了…以为是返回长度值…，然后写了个贼sb的求不重复元素个数的代码…审清题之后，很容易可以这样思考，用指针记录不重复数据的地址，不重复的元素根据这个指针存放。

class Solution(object):
    def removeDuplicates(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        i,index = 0,0
        while(i<len(nums)-1):
            if nums[i]!=nums[i+1]:
                index = index + 1
                nums[index] = nums[i+1]
                i = i+1
            else:
                i = i+1
        print(nums[:index+1])
        return nums[:index+1]

S = Solution()
nums = [0,0,1,1,1,2,2,3,3,4,5,5,6,7]
S.removeDuplicates(nums)

结果测评

Runtime: 68 ms, faster than 69.20% of Python online submissions for Remove Duplicates from Sorted Array.
Memory Usage: 13.7 MB, less than 24.72% of Python online submissions for Remove Duplicates from Sorted Array.

后边看Discuss里面的代码如下，有些地方不明白；碰上相同元素删前面的和删后面的元素操作有差别？原因是什么？

---

其他

		i = 0 
        while i<len(nums)-1:
            if nums[i]==nums[i+1]:
                del nums[i+1]
            else:
                i = i+1
        return len(nums)

结果测评

Runtime: 88 ms, faster than 34.59% of Python online submissions for Remove Duplicates from Sorted Array.
Memory Usage: 13.7 MB, less than 12.31% of Python online submissions for Remove Duplicates from Sorted Array.