283. Move Zeroes

283. Move Zeroes

Leetcode link for this question

Discription:

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.

Analyze:

Code 1:

class Solution(object):
    def moveZeroes(self, nums):
        """
        :type nums: List[int]
        :rtype: void Do not return anything, modify nums in-place instead.
        """

        count = nums.count(0)
        for i in range(count):
            nums.remove(0)
            nums.append(0)

Submission Result:

Status: Accepted
Runtime: 132 ms
Ranking: beats 21.69%

Analyze:

Code 2:

class Solution(object):
    def moveZeroes(self, nums):
        """
        :type nums: List[int]
        :rtype: void Do not return anything, modify nums in-place instead.
        """
        po,non_zero=0,0
        while(non_zero<len(nums)):   
            if(nums[non_zero]!=0):
                nums[po],nums[non_zero]=nums[non_zero],nums[po]
                po+=1
            non_zero+=1        

Submission Result:

Status: Accepted
Runtime: 112 ms
Ranking: beats 28.04%

Analyze:

The number of zero elements in front of a non-zero element is the moving distance of the non-zero element according to the final position.

Code 3:

class Solution(object):
    def moveZeroes(self, nums):
        """
        :type nums: List[int]
        :rtype: void Do not return anything, modify nums in-place instead.
        """

        count0=0
        for i in range(len(nums)):
            if nums[i]==0:
                count0+=1
            else:
                nums[i-count0]=nums[i]
        nums[-1:-1-count0:-1]=[0]*count0

Submission Result:

Status: Accepted
Runtime: 72 ms
Ranking: beats 82.88%