GoLang Solution For LeetCode Problem: Move Zeroes
Solving Move Zeroes in go. Please try yourself first to solve the problem and submit your implementation to LeetCode before looking into solution.
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.
Input: [0,1,0,3,12] Output: [1,3,12,0,0]
- You must do this in-place without making a copy of the array.
- Minimize the total number of operations.
See the full details of the problem Move Zeroes at LeetCode
Originally posted at: @github.com/halfrost/LeetCode-Go