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:You must do this in-place without making a copy of the array.Minimize the total number of operations.

**我的解决思路：像插入排序一样，将元素一个个插入到数组中，记住要判断插入的元素是否为0**

下面附上代码：

public class Solution {
    public void moveZeroes(int[] nums) {
        for(int i=1;i<nums.length;i++){
            
            for(int j=i;j>0;j--){

                if(nums[j-1]==0&&nums[j]!=0){
                    int temp = nums[j-1];
                    nums[j-1] = nums[j];
                    nums[j]=temp;
                }
            }
        }
    }
}