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.
For 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.
翻译:数组中重复点删除,然后返回新数组的长度。数组中前n个数就是新的数组。不能用额外空间。
class Solution(object):
def removeDuplicates(self, nums):
if not nums:
return 0
if len(nums) == 1:
return 1
cnt = int(len(nums))
flag_cnt = 1
for i in range(1,cnt):
if nums[i] != nums[i-1]:
nums[flag_cnt] = nums[i]
flag_cnt+=1
return flag_cnt