[Remove Duplicates from Sorted Array] LeetCode 26 #TwoPointers

pSolution1.py

class Solution:
    def removeDuplicates(self, nums: List[int]) -> int:
        insert_index = 1
		# Two pointer to the same direction
        # We can also use range(1, len(nums)) to have better performance by skip comparing nums[0] and nums[0]
        for i in range(len(nums)):
            # find different numbers
            if nums[i] != nums[insert_index - 1]:
                nums[insert_index] = nums[i]
                insert_index += 1
        return insert_index