80. Remove Duplicates from Sorted Array II
Read the full problem statement on LeetCode.
Difficulty: medium Acceptance: 63% Topics: Array, Two Pointers
View full problem on LeetCode Reading material
Reference solution (spoiler · python)
# Time: O(n)
# Space: O(1)
class Solution(object):
# @param a list of integers
# @return an integer
def removeDuplicates(self, A):
if not A:
return 0
last, i, same = 0, 1, False
while i < len(A):
if A[last] != A[i] or not same:
same = A[last] == A[i]
last += 1
A[last] = A[i]
i += 1
return last + 1
Solution from kamyu104/LeetCode-Solutions · MIT
Similar questions