283. Move Zeroes

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:

1. You must do this in-place without making a copy of the array.
2. Minimize the total number of operations.

Similar to bubble sort:

public class Solution {
    public void moveZeroes(int[] nums) {
        if(nums==null || nums.length<=1) return;
        for(int i=nums.length-2; i>=0; i--){
            if(nums[i]==0){
                for(int j=i; j<nums.length-1; j++){
                    if(nums[j+1]!=0){
                        int temp=nums[j+1];
                        nums[j+1]=nums[j];
                        nums[j]=temp;
                    }
                }
            }
        }
    }
}