leetcode283. 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.

Credits:
Special thanks to @jianchao.li.fighter for adding this problem and creating all test cases.

# 解题思路：将所有的非零值都移动到列表头，再将最后的元素设置为0
class Solution:
    def moveZeroes(self, nums):
        last = 0;
        for index in range(len(nums)):
            if nums[index] != 0:
                nums[last] = nums[index]
                last += 1
        for index in range(last, len(nums)):
            nums[index] = 0

class Solution:
    def moveZeroes(self, nums):
        for num in nums:
            if num == 0:
                nums.remove(num);
                nums.append(num);