Skip to content

283. Move Zeroes

Array Two Pointers

Problem - Move Zeroes

Easy

Given an integer array nums, move all 0's to the end of it while maintaining the relative order of the non-zero elements.

Note that you must do this in-place without making a copy of the array.

 

Example 1:

Input: nums = [0,1,0,3,12]
Output: [1,3,12,0,0]

Example 2:

Input: nums = [0]
Output: [0]

 

Constraints:

  • 1 <= nums.length <= 104
  • -231 <= nums[i] <= 231 - 1

 

Follow up: Could you minimize the total number of operations done?

Solutions

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
class Solution:
    def moveZeroes(self, nums: List[int]) -> None:
        """
        Do not return anything, modify nums in-place instead.
        """
        num_non_zeros = 0
        for i, num in enumerate(nums):
            if num:
                nums[num_non_zeros], nums[i] = nums[i], nums[num_non_zeros]
                num_non_zeros += 1

Submission Stats:

  • Runtime: 5 ms (51.49%)
  • Memory: 19 MB (9.83%)