[LeetCode]26. Remove Duplicates from Sorted Array
要求原位去重排序,返回nums的length并用nums的引用来检查排序,非常无聊的字符操作 不如来一发深拷贝吧~233
Success
Details Runtime: 92 ms, faster than 90.98% of Python3 online submissions for Remove Duplicates from Sorted Array.
Memory Usage: 15.6 MB, less than 5.74% of Python3 online submissions for Remove Duplicates from Sorted Array.
Next challenges:
Submission Detail
161 / 161 test cases passed.
|
Status:
Accepted |
Runtime: 92 ms
Memory Usage: 15.6 MB
|
Submitted: 3 minutes ago
|
class Solution: def removeDuplicates(self, nums: List[int]) -> int: length = len(nums) # 0 1 if length == 0 or length == 1: return length #normal nums[:] = list(set(nums)) nums.sort() return len(nums)
80ms:
class Solution: def removeDuplicates(self, nums: List[int]) -> int: i, j = 0, 1 l = len(nums) while j < l: if nums[i] == nums[j]: j+=1 else: i+=1 nums[i] = nums[j] return i+1
14M:
class Solution: def removeDuplicates(self, nums: List[int]) -> int: if len(nums) == 0: return 0 n_pre = len(nums) cnt = 0 cur = nums[0] i = 1 while i < len(nums): if nums[i] == cur: nums.pop(i) cnt += 1 else: cur = nums[i] i += 1 return n_pre - cnt
【推荐】编程新体验,更懂你的AI,立即体验豆包MarsCode编程助手
【推荐】凌霞软件回馈社区,博客园 & 1Panel & Halo 联合会员上线
【推荐】抖音旗下AI助手豆包,你的智能百科全书,全免费不限次数
【推荐】博客园社区专享云产品让利特惠,阿里云新客6.5折上折
【推荐】轻量又高性能的 SSH 工具 IShell:AI 加持,快人一步