#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.

#Example 1:
#Given nums = [1,1,2],
#Your function should return length = 2, with the first two elements of nums being 1 and 2 respectively.
#It doesn't matter what you leave beyond the returned length.

class Solution(object):
    def removeDuplicates(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        n = len(nums)
        
        if n < 2:
            return n
        
        i, j = 0, 1
        
        while j < n:
            if nums[i] != nums[j]:
                i += 1
            
            nums[i] = nums[j]
            j += 1
        
        return i+1

29f52ce84d737309647de5408687c04ee5e762d5
<mask token>

class Solution(object):
    <mask token>

class Solution(object):

    def removeDuplicates(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        n = len(nums)
        if n < 2:
            return n
        i, j = 0, 1
        while j < n:
            if nums[i] != nums[j]:
                i += 1
            nums[i] = nums[j]
            j += 1
        return i + 1

#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.

#Example 1:
#Given nums = [1,1,2],
#Your function should return length = 2, with the first two elements of nums being 1 and 2 respectively.
#It doesn't matter what you leave beyond the returned length.

class Solution(object):
    def removeDuplicates(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        n = len(nums)
        
        if n < 2:
            return n
        
        i, j = 0, 1
        
        while j < n:
            if nums[i] != nums[j]:
                i += 1
            
            nums[i] = nums[j]
            j += 1
        
        return i+1
