Leetcode刷题_快慢指针

数组

6.15

27. 移除元素

1）快慢指针做法：

class Solution:
    def removeElement(self, nums: List[int], val: int) -> int:
        slow = fast = 0

        while fast < len(nums):
            if nums[fast] != val:
                nums[slow] = nums[fast]
                slow += 1
            else:
                fast += 1
        return slow

 这个不对，因为不管nums[fast]是否等于val，fast都要+1，所以应该是：

class Solution:
    def removeElement(self, nums: List[int], val: int) -> int:
        slow = fast = 0

        while fast < len(nums):
            if nums[fast] != val:
                nums[slow] = nums[fast]
                slow += 1
            fast += 1
        return slow

slow = fast = 0 而不是slow, fast = 0, 0是因为后者两个地址不一样，前者两个指向同一地址

2）如果直接边遍历边删除，那下标会改变，aka会跳着删，eg：

class Solution:
    def removeElement(self, nums: List[int], val: int) -> int:
        for num in nums:
            if num == val:
                nums.remove(val)
        return len(nums)

输入：

nums = [3,2,2,2,2,2,2,2,2,2,3]
val = 2

返回：

[3, 2, 2, 2, 2, 3]

所以需要写成nums[:]：

class Solution:
    def removeElement(self, nums: List[int], val: int) -> int:
        for num in nums[:]:
            if num == val:
                nums.remove(val)
        return len(nums)

6.17

26. 删除有序数组中的重复项

看了输出想偷懒，结果报错了

class Solution:
    def removeDuplicates(self, nums: List[int]) -> int:
         a = set(nums)
         b = len(a)
         return b

 然后不太确定快慢指针怎么走，所以重新写了

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

结果在测试用例是[1]的时候，就报错了，只能在pycharm里面debug一下了

要从第二个位置开始，但是还是有点懵

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

这个得问一下

6.29

283. 移动零

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

这个fast += 1，是每次都要使用到的，所以以上等同于：

class Solution:
    def moveZeroes(self, nums: List[int]) -> None:
        """
        Do not return anything, modify nums in-place instead.
        """
        slow = fast = 0
        middle = 0
        while fast < len(nums):
            if nums[fast] != 0:
                middle = nums[fast]
                nums[fast] = nums[slow]
                nums[slow] = middle
                slow +=1
                fast +=1
            else:
                fast +=1

字符串