mirror of
https://github.com/20kaushik02/leetcode-gulag.git
synced 2025-12-06 06:24:07 +00:00
20 lines
625 B
Python
20 lines
625 B
Python
class Solution:
|
|
def removeDuplicates(self, nums: list[int]) -> int:
|
|
# naive, hashmap
|
|
# cnts = {}
|
|
# k = 0
|
|
# for x in nums:
|
|
# if cnts.get(x) == None:
|
|
# k += 1
|
|
# cnts[x] = cnts.get(x, 0) + 1
|
|
# for idx, key in enumerate(cnts.keys()):
|
|
# nums[idx] = key
|
|
# return k
|
|
# two pointer
|
|
last_unique = 0
|
|
for fast in range(1, len(nums)):
|
|
if nums[last_unique] != nums[fast]:
|
|
last_unique += 1
|
|
nums[last_unique] = nums[fast]
|
|
return last_unique + 1 # zero-indexed
|