题目 python代码 def removeDuplicates(nums): n = len(set(nums)) i = 0 while i < n: if nums[i] == nums[i+1]: temp = nums[i+1] nums[i+1: len(nums) -1] = nums[i+2:] nums[-1] = temp continue else: i += 1 return n