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) {
for(int i = 0; i < nums.length; i++){
if(nums[i] == 0 && i != nums.length-1){
for(int n = i+1; n<nums.length; n++){
if(nums[n] != 0) {
helper(nums,i,n);
break;
}
}
}
}
}
private void helper (int [] nums, int i, int n){
int temp = nums[i];
nums[i] = nums[n];
nums[n] = temp;
}
}