题目:
给定一个排序数组,在原地删除重复出现的元素,使得每个元素只出现一次,返回移除后数组的新长度
Python3实现:
class Solution:
def removeDuplicates(self, nums: List[int]) -> int:
if len(nums)<2:
return len(nums)
j=0
for i in range(len(nums)):
if( nums[j]!=nums[i]):
j=j+1
nums[j]=nums[i]
continue
return j+1