力扣 移动零

给定一个数组 nums，编写一个函数将所有 0 移动到数组的末尾，同时保持非零元素的相对顺序。

示例:

输入: [0,1,0,3,12]
输出: [1,3,12,0,0]
说明:

必须在原数组上操作，不能拷贝额外的数组。
尽量减少操作次数。

---

思路：常规

class Solution:
    def moveZeroes(self, nums: List[int]) -> None:
        """
        Do not return anything, modify nums in-place instead.
        """
        o = len(nums)
        while 0 in nums:
            nums.remove(0)
        zero =  o - len(nums)

        for o in range(zero):
            nums.append(0)

        return nums

class Solution:
    def moveZeroes(self, nums: List[int]) -> None:
        """
        Do not return anything, modify nums in-place instead.
        """
        zero = 0
        i = -1
        while i < len(nums)-1:
            i += 1
            if(nums[i] == 0):
                del nums[i]
                zero += 1
                i -= 1

        for _ in range(zero):
            nums.append(0)

        return nums

思路:双指针

class Solution:
    def moveZeroes(self, nums: List[int]) -> None:
        """
        Do not return anything, modify nums in-place instead.
        """
        left = 0
        right = 0
        while right<len(nums):
            if(nums[right]!=0):
                nums[left],nums[right] = nums[right],nums[left]
                left += 1
            right += 1

        return nums