The problem belongs to LeetCode, here is the link to the problem

Following code segment contains the description in the class comments, followed by fully working solution

/**
 * Given an integer array nums, move all 0's to the end of it while maintaining the relative order of the non-zero elements.
 *
 * Note that you must do this in-place without making a copy of the array.
 *
 * Example 1:
 * Input: nums = [0,1,0,3,12]
 * Output: [1,3,12,0,0]
 */
public class MoveZeroes {
    public void moveZeroes(int[] nums) {
        int j=0;
       for(int i=0;i < nums.length;i++){
           if(nums[i]!=0){
               nums[j++]=nums[i];
           }
       }
       for(int i=j;i < nums.length;i++){
           nums[i]=0;
       }
    }
}