Move Zeroes - Python Solution @ LeetCode
Move Zeroes, is a LeetCode problem. In this post we will see how we can solve this challenge in Python
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].
You must do this in-place without making a copy of the array. Minimize the total number of operations.
Credits:Special thanks to @jianchao.li.f ....
You can find the full details of the problem Move Zeroes at LeetCode
Solution: Please check the main.py snippet for the solution.
This solution originally posted at: Github by @kamyu104