26. Remove Duplicates from Sorted Array python

Given a sorted array nums, 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 by modifying the input array in-place with O(1) extra memory.

Example 1:

Given 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 returned length.

Example 2:

Given nums = [0,0,1,1,1,2,2,3,3,4],

Your function should return length = 5, with the first five elements of nums being modified to 0, 1, 2, 3, and 4 respectively.

locate eIt doesn't matter what values are set beyond the returned length.

这也是一道很简单的题，没有复杂度的考虑，知识要求不能使用新的空间

class Solution(object):
    def removeDuplicates(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        i=0

        length=len(nums)
        
        if(length<=1):
            return len(nums)
        while(1):
            if(nums[i]==nums[i+1]):
                nums.pop(i)
                i=i-1
                length=length-1
                
            i=i+1
            if(i>=length-1):
                break
        return len(nums)
         

唯一需要注意的是list的pop和remove方法

pop 和remove的区别：pop是根据索引删除，remove是根据字符删除第一个符合的字符

参考举例：https://www.cnblogs.com/ninarming/p/7485917.html