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 length = nums.length;
if(length==0) return;
int count=0;
int i=0;
int j;
while(count<length) {
if(nums[i]==0) {
j=i;
while(j<length-1) {
nums[j]=nums[j+1];
j++;
}
nums[j]=0;
count++;
}
else {
i++;
count++;
}
}
//for( int k:nums) System.out.println(k);
}
}