
该题仍然采用快慢指针,但先要提前设置。若快慢指针所指向元素相等,则快指针向前移动一位,慢指针不动,再次判断,直至快慢指针所指向元素不相等,则慢指针向前移动一位让快指针所指元素进行覆盖。
方法一
# -*- coding: utf-8 -*-
"""
@Time : 2022/8/5 16:05
@Author : FJC
@File : 删除有序数组中的重复项2.py
@Software: win10 python3.7
"""
class Solution:
def removeDuplicates(self,nums):
slow=0
n=len(nums)
for fast in range(n):
if nums[fast]==nums[slow]:
continue
else:
nums[slow+1]=nums[fast]
slow+=1
print(slow+1)
return nums
solution = Solution()
print(solution.removeDuplicates([0, 1, 2, 2, 2,3,4]))
方法二
# -*- coding: utf-8 -*-
"""
@Time : 2022/8/5 15:20
@Author : FJC
@File : 删除有序数组中的重复项1.py
@Software: win10 python3.7
"""
class Solution:
def removeDuplicates(self,nums):
slow=0
n=len(nums)
for fast in range(1,n):
print(fast)
if nums[fast] != nums[slow]:
if nums[fast]-nums[slow]>0:
nums[slow+1] = nums[fast]
slow += 1
print(slow+1)
return nums
solution = Solution()
print(solution.removeDuplicates([0, 1, 2, 2, 2,3,4]))