Problem solving -- question 283 of leetcode question bank

One .Leetcode Item bank No 283 Title

283. Move zero

Two . Idea of problem solving

        This question is the same as the previous one 26. Remove duplicate items from an ordered array and 27. Remove elements The two problems can be solved relatively conveniently by using the double pointer solution . Slow pointer update new array （0 All at the end ）, Fast pointer traverses array elements , Look for non-zero elements

3、 ... and . Double pointer code

class Solution(object):
    def moveZeroes(self, nums):
        """
        :type nums: List[int]
        :rtype: None Do not return anything, modify nums in-place instead.
        """
        slow,fast=0,0
        while fast<=len(nums)-1:
            if nums[fast] !=0:
                nums[slow]=nums[fast]
                slow+=1
            fast+=1
        for i in range(slow,fast):
            nums[i]=0

Four . Code parsing  

1. The first is the very conventional double pointer problem solving template , Get a new array containing all non-zero elements
2. Secondly, the remaining parts become zero