{leetcode}/problems/move-zeroes/[LeetCode - Move Zeroes^]
每次答案都比我写的简洁！
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.
Example:
Input:[0,1,0,3,12]Output:[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.
link:{sourcedir}/_0283_MoveZeroes.java[role=include]