Leetcode Move Zeros

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 void moveZeroes(int[] nums) {
        int len = nums.length;
        int index = 0;
        int zero_num=0;
        while(index < len-zero_num && judge(nums,index))
        {
            while(nums[index] == 0)
            {
                int i = index;
                for(;i <len - 1; i++)
                {
                    nums[i] = nums[i + 1];
                }
                nums[i] = 0;
                zero_num++;
            }
            index++;
        }
    }
    public boolean judge(int [] nums, int index)
    {
        for(;index < nums.length;index++)
        {
            if(nums[index]!=0)
                return true;
        }
        return false;
    }