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].
Note:
You must do this in-place without making a copy of the array.
Minimize the total number of operations.
//将后面不为零的数字从头开始复制到数组的开头
public class Solution { public void moveZeroes(int[] nums) { int pos = 0; for(int i =0; i < nums.length; i++){ if(nums[i]!= 0){ nums[pos]=nums[i]; pos++; } } for(;pos<nums.length;pos++){ nums[pos] = 0; } } }