[LeetCode&Python] Problem 283. Move Zeroes

标签：note   number   sel   self   elements   obj   output   leetcode   operation   

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.

Example:

Input: [0,1,0,3,12]
Output: [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.
        """
        j = 0
    
        for i in range(len(nums)):
            if nums[i] != 0:
                nums[j] = nums[i] 
                j += 1
            
        nums[j:] = [0] * (i - j + 1)

[LeetCode&Python] Problem 283. Move Zeroes

标签：note   number   sel   self   elements   obj   output   leetcode   operation   

原文地址：https://www.cnblogs.com/chiyeung/p/9882400.html