【LEETCODE】283-Move Zeroes

Given an array nums, write a function to move all 0's to the end of it while maintaining the relative order of the non-zero elements.

For example, given nums = [0, 1, 0, 3, 12], after calling your function, nums should be [1, 3, 12, 0, 0].

Note:

  1. You must do this in-place without making a copy of the array.
  2. Minimize the total number of operations.



class Solution(object):
    def moveZeroes(self, nums):
        """
        :type nums: List[int]
        :rtype: void Do not return anything, modify nums in-place instead.
        """
        
        a=b=0
        
        for b in range(len(nums)):
            if nums[b]!=0:
                t=nums[a]
                nums[a]=nums[b]
                nums[b]=t
                a+=1
        #return nums


你可能感兴趣的:(LeetCode,python)