"""
Given a sorted array nums, remove the duplicates in-place such that each
element appear only once and return the new length.

Do not allocate extra space for another array, you must do this by modifying
the input array in-place with O(1) extra memory.
"""

class Solution:
    def removeDuplicates(self,nums):
        l = len(nums)
        if (l == 0):
            return 0

        pos = 1

        for i in range(1, l):
            if (nums[i] != nums[i-1]):
                nums[pos] = nums[i]
                pos += 1

        return pos
