leetcode
This commit is contained in:
8
leetcode/26.py
Normal file
8
leetcode/26.py
Normal file
@@ -0,0 +1,8 @@
|
||||
class Solution:
|
||||
def removeDuplicates(self, nums: List[int]) -> int:
|
||||
arr=sorted(list(set(nums)))
|
||||
count=len(arr)
|
||||
|
||||
for i in range(count):
|
||||
nums[i]=arr[i]
|
||||
return count
|
||||
Reference in New Issue
Block a user