java 移动数字“0”算法

题目： 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.

下面是我给出的算法：

public class Solution {
   public void moveZeroes(int[] nums) {
        for(int j=0;j<nums.length;j++){
            if(nums[j]==0){
                int temp = nums[j];
                int k = j;
                while(k<nums.length-1){
                    nums[k]=nums[k+1];
                    k++;
                }
                nums[nums.length-1] = -1;   //用数字-1补全数组，然后遍历数组将-1替换为0;
                j--;
            }
        }

        for(int i=0;i<nums.length;i++){
            if(nums[i]==-1){
                nums[i]=0;
            }
        }
   }
}