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]
Note:
代码：
class Solution { public void moveZeroes(int[] nums) { int index = 0; for(int i = 0; i<nums.length; i++){ if(nums[i] != 0){ nums[index]=nums[i]; index++; } } for(int i = index; i< nums.length; i++){ nums[i] = 0; } } }
原文：https://www.cnblogs.com/liuliu5151/p/9059077.html