Leetcode - Move Zeroes

Question
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.

Java Code

public void moveZeroes(int[] nums) {
    int len = nums.length;
    int i = 0;

    //             
    while(nums[i] != 0)
        if((++i) == len) return;

    //  j           ，  i          
    //                 ，             
    int j = i;
    while(j < len) {
        if(nums[j] != 0)
            nums[i++] = nums[j];
        ++j;
    }

    //      0   ，        ，      0  
    int zeros = j - i;
    while(zeros > 0) {
        nums[len - zeros] = 0;
        --zeros;
    }   
}