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]. ``` public class Solution { public void moveZeroes(int[] nums) { int cnt = 0, pos = 0; // 将非0数字都尽可能向前排 for(int i = 0; i < nums.length; i++){ if(nums[i] != 0){ nums[pos]= nums[i]; pos++; } } // 将剩余的都置0 for(;pos<nums.length; pos++){ nums[pos] = 0; } } } ```