Skip to content

Latest commit

 

History

History
22 lines (12 loc) · 381 Bytes

File metadata and controls

22 lines (12 loc) · 381 Bytes

Problem 283: Move Zeroes

Difficulty: Easy

Problem

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.

Note:

You must do this in-place without making a copy of the array.

Minimize the total number of operations.

Example

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