Leetcode刷题-双指针（原地修改）

原创

已于 2025-02-07 23:14:40 修改 · 342 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode #算法 #职场和发展 #python

于 2025-02-04 22:28:17 首次发布

class Solution:
    def removeElement(self, nums: List[int], val: int) -> int:
        k = 0
        for x in nums:
            if x != val:
                nums[k] = x
                k += 1
        return k

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

class Solution:
    def removeDuplicates(self, nums: List[int]) -> int:
        if len(nums) < 3:
            return len(nums)
        k = 2
        for i in range(2,len(nums)):
            if nums[i] != nums[k - 2]:
                nums[k] = nums[i]
                k += 1
        return k

283