LeetCode 283 _ 移动零

1. 题目描述

2. 代码

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

思路: 双指针, i 用来判断哪一位是0, 若当前位是0, 则 i+1.

         若当前位不是0, 则j用来记录不是0的位.

         先循环完i, 然后j更新了数组不为0的位, 然后再循环j补足0.