[LeetCode] 283. Move Zeroes ☆(移动0到最后)

public static void main(String[] args) {
        int[] n = {4,2,4,0,0,3,0,5,1,0};
        moveZero(n);
        System.out.println(JSON.toJSONString(n));
    }

    public static void moveZero(int[] n) {
        if (n == null || n.length < 2) {
            return;
        }
        int slow = 0;
        int fast = 1;
        while (fast < n.length && slow < n.length) {
            if (n[slow] == 0 && n[fast] != 0) {
                swap(n, slow++, fast++);
            } else if (n[slow] == 0 && n[fast] == 0) {
                fast++;
            } else {
                slow++;
                fast++;
            }
        }
    }

    public static void swap(int[] n, int a, int b) {
        if (a == b) {
            return;
        }
        n[a] = n[a] ^ n[b];
        n[b] = n[a] ^ n[b];
        n[a] = n[a] ^ n[b];
    }