LeetCode 26 – Python 3 (Week 5 – 05)

class Solution:
    def removeDuplicates(self, nums: List[int]) -> int:
        length = 0
        for i in range(len(nums)):
            if nums[length] != nums[i]:
                length += 1                
                nums[length] = nums[i]
                
        return length + 1

class Solution:
    def removeDuplicates(self, nums: List[int]) -> int:
        i = 0
        while i < len(nums)-1:
            if nums[i] == nums[i+1]:
                nums.remove(nums[i+1])
            else: i += 1
                
        return len(nums)