# 此方法适用于排序数组 class Solution: def removeDuplicates(self, nums): """ :type nums: List[int] :rtype: int """ j = 0 while j < len(nums)-1: if nums[j] == nums[j+1]: nums.remove(nums[j]) else: j = j + 1 return len(nums)
# 此方法适用于排序数组 class Solution: def removeDuplicates(self, nums): """ :type nums: List[int] :rtype: int """ j = 0 while j < len(nums)-1: if nums[j] == nums[j+1]: nums.remove(nums[j]) else: j = j + 1 return len(nums)
