解析

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

//! n,1
class Solution {
public:
  void moveZeroes(vector<int> &nums) {
    int slow = 0; // slow point to non-zero,fast the other
    for (int fast = 0; fast < nums.size(); ++fast) {
      if (nums[fast] != 0) {
        swap(nums[slow], nums[fast]);
        ++slow;
      }
    }
  }
};