from typing import List
defppo(nums:List[int])-> List[int]:
lenth =len(nums)if lenth ==0or lenth ==1:return lenth
i =0while i < lenth:if nums[-1]== nums[0]andlen(nums)!=1:
i +=1del nums[0]continue
now = nums[0]del nums[0]
nums.append(now)
i +=1
outLenth =len(nums)return outLenth
defremoveDuplicates(self, nums: List[int])->int:iflen(nums)==1:return1ifnot nums:return0
i =0
j =1
flag = nums[i]while(i<len(nums)):if nums[i]== flag:
i +=1else:
flag = nums[i]
nums[j]= flag
j +=1
i +=1return j