4/10/2017 - 2:42 PM

26-Remove-Duplicates-from-Sorted-Array <----> leetcode-2

26-Remove-Duplicates-from-Sorted-Array <----> leetcode-2

class Solution(object):
    def removeDuplicates(self, nums):
        :type nums: List[int]
        :rtype: int
        if len(nums) == 0:
            return 0
        self.slow = 0
        for fast in range(len(nums)):
            # For each element in nums
            if nums[fast] != nums[self.slow]:
                # If slow != fast, slow+1 ,and add the new value.
                self.slow += 1
                nums[self.slow] = nums[fast]
        return self.slow+1

Given a sorted array, 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 in place with constant memory.

For example, Given input array 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 new length.