leetcode in python 283

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.

关键词：Do not return anything, modify nums in-place instead.不要return

时间自由度：O（n）

class Solution(object):
    def moveZeroes(self, nums):
        """
        :type nums: List[int]
        :rtype: void Do not return anything, modify nums in-place instead.
        """
        number = 0
        for i in xrange(len(nums)):
            if nums[number] == 0:
                del nums[number]
                nums.append(0)
                number = number-1
            number+=1