leetcode 26. Remove Duplicates from Sorted Array

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.

思路：使用index记住当前位置，从下标1开始遍历list，如果重复则替换index+1的位置。返回index+1.

class Solution(object):    def removeDuplicates(self, nums):        """        :type nums: List[int]        :rtype: int        """        if len(nums)==0:return 0        ind=0;i=1        while i<len(nums):            if nums[ind]!=nums[i]:                ind+=1;nums[ind]=nums[i]            i+=1        return ind+1