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.

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.

Solution

• Java: i记录当前不重复的index，便利所有Nums，不重复的插入到i的位置 File /Users/minli/Desktop/Personal/sdytlm.github.io/source/downloads/code/LeetCode/Java/Remove-Duplicates-from-Sorted-Array.java could not be found

• Python

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24

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

            if j < len(nums):
                nums[index] = nums[j]
                index += 1
            i = j
        return ret