leet_26_Remove_Duplicates_from_Sorted_Array

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 :

Given nums = [0,0,1,1,1,2,2,3,3,4],

Your function should return length = 5, with the first five elements of nums being modified to 0, 1, 2, 3, and 4 respectively.

It doesn't matter what values are set beyond the returned length.

我的实现：

def fore_cover(arr, j, k):
    for t in range(j, k + 1):
        arr[t-1] = arr[t]

def remove_duplicate(arr):
    j = 0
    i = 1
    for _ in range(len(arr) - 1):
        if arr[j] == arr[i]:
            fore_cover(arr, i, len(arr) - 1)
        else:
            j += 1
            i += 1
    return j+1, arr[:j+1]

if __name__ == "__main__":
    arr = [1, 2, 2, 2, 2, 3, 3, 4, 5]
    print(remove_duplicate(arr))

pythonic imply :

class Solution:
    def remove_duplicate(self, nums):
        for i in range(1,len(nums))[::-1]:
            if nums[i] == nums[i-1]: del nums[i]
        return len(nums), nums