leedcode-移动零

自己写的，冒泡排序，时间爆炸

class Solution:
    def moveZeroes(self, nums) -> None:
        """
        Do not return anything, modify nums in-place instead.
        """

        n=len(nums)
        for i in range(n-1):
            for j in range(n-1-i):
                if nums[j]==0:
                    nums[j],nums[j+1]=nums[j+1],nums[j]

 双指针：

class Solution:
    def moveZeroes(self, nums: List[int]) -> None:
        i = 0  #其中 i 用于追踪当前已经处理过的非零元素的位置
        for j in range(len(nums)):
            if nums[j] != 0:
                nums[j], nums[i] = nums[i], nums[j]
                i += 1