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.
Since it is impossible to change the length of the array in some languages, you must instead have the result be placed in the first part of the array
More formally, if there are
k elements after removing the duplicates, then the first
k elements of
nums should hold the final result. It does not matter what you leave beyond the first
k after placing the final result in the first
k slots of
Remove Duplicates from Sorted Array (Python)
class Solution: def removeDuplicates(self, nums: List[int]) -> int: j=0; l=len(nums) for i in range(len(nums)-1): if nums[i]==nums[i+1]: pass else: j +=1 nums[j]=nums[i+1] return j+1
Disclaimer: This problem(Remove Duplicates from Sorted Array) is originally created by Leetcode. Codesagar only provides a solution for it. This solution is only for Educational and learning purposes.