题目:
    给定一个数组 nums，编写一个函数将所有 0 移动到数组的末尾，同时保持非零元素的相对顺序。

    1. /**
    2. Do not return anything, modify nums in-place instead.
    3. */
    5. function moveZeroes(nums: number[]):void {
    6.     let index =0;
    7.     for (let i =0; i <nums.length; i++) {
    8.         if (nums[i] ===0) continue;
    9.         nums[index++] = nums[i];
    10.     }
    11.     while (index <nums.length) {
    12.         nums[index] =0;
    13.         index++;
    14.     }
    15. }
    1. classSolution {
    2.     publicvoid moveZeroes(int[] nums){
    3.         intslow=0;
    4.         for(intfast=0; fast <nums.length; fast++){
    5.             if(nums[fast] !=0) nums[slow++] = nums[fast];
    6.         }
    7.         while(slow <nums.length){
    8.             nums[slow++] =0;
    9.         }
    10.     }
    11. }