283. Move Zeroes

直接覆盖 O(n)

class Solution {
public:
    void moveZeroes(vector<int>& nums) {
        int n = nums.size();
        int j = 0;
        for (int x : nums) {
            if (x != 0) {
                nums[j++] = x;
            }
        }
        fill(begin(nums) + j, end(nums), 0);
    }
};

swap O(n)

class Solution {
public:
    void moveZeroes(vector<int>& nums) {
        int n = nums.size();
        int i = 0, j = 0;
        while (j < n) {
            while (i < n && nums[i] != 0) ++i;
            for (j = i + 1; j < n && nums[j] == 0; ++j);
            if (j >= n) break;
            swap(nums[i], nums[j]);
            ++i;
        }
    }
};