JAVA - Algorithms - Classical swapping method
class Solution { public void moveZeroes ( int [ ] nums ) { int remove = 0 ; for ( int i = 0 , j = 0 ; j < nums . length ; j ++ ) { if ( nums [ j ] != remove ) { int swap = nums [ i ] ; nums [ i ] = nums [ j ] ; nums [ j ] = swap ; i ++ ; } } return ; } }