任务描述
思路
-双指针
实现代码
class Solution:
def removeDuplicates(self, nums: List[int]) -> int:
if len(nums) <=1:
return len(nums)
i = 0
for j in range(1,len(nums)):
if nums[i] != nums[j]:
nums[i+1] = nums[j]
i += 1
return i+1