本文共 734 字，大约阅读时间需要 2 分钟。

Total Accepted: 61817 Total Submissions: 141889 Difficulty: Easy

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:

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

class Solution(object):    def moveZeroes(self, nums):        j=0;counts=0        for i in range(len(nums)):            print nums[i]            if nums[i]!=0:                nums[j]=nums[i]                j=j+1            else:                counts=counts+1        for i in range(j,len(nums)):                nums[i]=0

转载地址：http://fzqmi.baihongyu.com/