Given an integer array nums, move all 0's to the end of it while maintaining the relative order of the non-zero elements.
Note that you must do this in-place without making a copy of the array.
Example 1:
Input: nums = [0,1,0,3,12] Output: [1,3,12,0,0]
Example 2:
Input: nums = [0] Output: [0]
Solution
class Solution {
public void moveZeroes(int[] nums) {
int nonZeroIndex = 0;
// move non zero numbers
for(int i=0; i<nums.length; i++) {
if(nums[i] != 0) {
nums[nonZeroIndex++] = nums[i];
}
}
// append 0s
for(int j=nonZeroIndex; j < nums.length; j++) {
nums[j] = 0;
}
}
}
