26.remove_duplicate.py

# 26. Remove Duplicates from Sorted Array
# Given an integer array nums sorted in non-decreasing order, 
# remove the duplicates in-place such that each unique element appears only once. 
# The relative order of the elements should be kept the same. 
# Then return the number of unique elements in nums.

# Consider the number of unique elements of nums to be k, to get accepted, 
# you need to do the following things:

# Change the array nums such that the first k elements of nums contain the unique elements in the order 
# they were present in nums initially. 
# The remaining elements of nums are not important as well as the size of nums.
# Return k.


def removeDuplicates(nums):
        a=set(nums)
        nums[:]=sorted(list(a))
        return len(nums)


def removeDuplicates(nums):
        nums[:]=list(set(nums))
        nums.sort()
        return len(nums)
print(removeDuplicates([-1,-1,0,3,3]))


def removeDuplicates(nums):
        l=1
        for i in range(1,len(nums)):
            if nums[i]!=nums[i-1]:
                nums[l]=nums[i]
                l+=1
        return l

print(removeDuplicates([-1,-1,0,3,3]))