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

For example, given nums = [0, 1, 0, 3, 12], after calling your function, nums should be [1, 3, 12, 0, 0].

Note:

1. You must do this in-place without making a copy of the array.

1. Minimize the total number of operations.

public class Solution {    public void moveZeroes(int[] nums) {        int fast=0;//fast指针表示当前位置        int slow=0;//slow指针表示当前元素所要移动到的位置        for(;fast<nums.length;slow++){            if(nums[fast]!=0)                nums[slow++]=nums[fast];        }        while(slow<nums.length){            nums[slow]=0;            slow++;        }    }}