【leetcode】(python) 26. Remove Duplicates from Sorted Array从排序数组中删除重复项

Description

26. Remove Duplicates from Sorted Array Easy

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

• 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]);
}

题意

从一排序数组中删除重复元素，使每个元素只出现一次且返回其长度。

要求：不能重新申请内存空间，只能在原数组在修改。

比如一个数组其值为 [1,1,2]，程序执行结束后，返回的长度应该为2，并且数组 的前两个元素应该为1和2。

解题思路

考研过的同学对这题应该非常熟悉，王道课后原题。

这里使用双指针的方法:一个指针i用来遍历原数组,一个指针j指向新数组。如果nums[i]不等于nums[j]的值，则将nums[i]赋值给nums[j]，最后返回j+1值即新数组长度。

code

class Solution:
    def removeDuplicates(self, nums: List[int]) -> int:
        if len(nums) == 0:
            return 0
        i = j = 0
        while i<len(nums):
            while i < len(nums)-1 and nums[i] == nums[i+1]:
                i += 1
            if i < len(nums) and i!=j:
                nums[j] = nums[i]
            i+=1
            j+=1
        return j

快慢指针code

class Solution:
    def removeDuplicates(self, nums: List[int]) -> int:
        n = len(nums)
        if n == 0:
            return 0
        slow = 0
        fast = 1
        while fast<n:
            if nums[slow] != nums[fast]:
                slow += 1
                nums[slow] = nums[fast]
            fast += 1
        return slow+1