题解:
class Solution:
def removeDuplicates(self, nums: List[int]) -> int:
# 如果列表为空,直接返回0
if len(nums) == 0:
return 0
# 定义慢指针、快指针
slow = fast = 0
while fast < len(nums):
# 如果慢指针指向的元素!=快指针指向的元素,
# 说明慢指针可以向前一步,并赋值快指针指向的元素值
if nums[slow] != nums[fast]:
slow += 1