leetcode.283. 移动零

给定一个数组，将非0的数移动到数组左边，0移动到后边，非0元素相对次序不变

例子：{2,1,0,3,5,6,0,8,9,0,11}->{2,1,3,5,6,8,9,11,0,0,0}

这个很简单直接看代码

public static void moveZeroes(int[] nums) {
        int slow = 0;
        for (int fast = 0; fast < nums.length; fast++) {
            if (nums[fast] != 0) {
                nums[slow] = nums[fast];
                slow++;
            }
        }
        for (int i = slow; i < nums.length; i++) {
            nums[i] = 0;

        }
    }