Skip to content

class Solution(object): def removeDuplicates(self, nums): if not nums:return 0 k=1 for i in range(1,len(nums)): if nums[i]!=nums[i-1]: nums[k]=nums[i] k+=1 return k

Notifications You must be signed in to change notification settings

Sahithya-2007/remove-duplicates-from-sorted-array

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

1 Commit
 
 

Repository files navigation

remove-duplicates-from-sorted-array

class Solution(object): def removeDuplicates(self, nums): if not nums:return 0 k=1 for i in range(1,len(nums)): if nums[i]!=nums[i-1]: nums[k]=nums[i] k+=1 return k

About

class Solution(object): def removeDuplicates(self, nums): if not nums:return 0 k=1 for i in range(1,len(nums)): if nums[i]!=nums[i-1]: nums[k]=nums[i] k+=1 return k

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published