题目描述:给定一个排序数组,你需要在原地删除重复出现的元素,使得每个元素只出现一次,返回移除后数组的新长度
我的投机取巧解:
nums = [0,0,1,1,1,2,2,3,3,4]
n2 = [1,1,2]
n3 = [2,2,2,3,4,4]
n4 = [1,1,1,1]
def removeDuplicates(nums):
r = list(set(nums))
nums.clear()
nums = nums+r
return len(nums)
print(removeDuplicates(nums))
print(removeDuplicates(n2))
print(removeDuplicates(n3))
print(removeDuplicates(n4)
==================================
output:
5
2
3
1
这代码在我本地跑着没问题,但是在leetcode网页上执行的时候,报错
IndexError: list index out of range
Line 46 in _serialize_list (./python3/__serializer__.py)
Line 91 in serialize (./python3/__serializer__.py)
Line 33 in _driver (Solution.py)
Line 42 in <module> (Solution.py)
难道leetcode还有检测作弊模式?
附一个正常思路的解
def removeDuplicates(nums):
i = 0
while i<len(nums)-1:
if nums[i] == nums[i+1]:
nums.pop(i)
else:
i = i+1
return len(nums)