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

Example:

Input: [0,1,0,3,12]
Output: [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.

class Solution {
    public void moveZeroes(int[] nums) {
        int zero = 0, l = 0, r = nums.length;
        while(l < r)
        {
            if(nums[l] != 0)
            {
                int tmp = nums[zero];
                nums[zero++]  =  nums[l];
                nums[l] = tmp;
            }
            l++;
        }
    }
}