283. Move Zeroes

Given an array nums, write a function to move all 0's to the end of it while maintaining the relative order of the non-zero elements.

For example, given nums = [0, 1, 0, 3, 12], after calling your function, nums should be [1, 3, 12, 0, 0].

Note:

1. You must do this in-place without making a copy of the array.
2. Minimize the total number of operations

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
class Solution
{
public:
	void moveZeroes(vector<int> &nums)
	{
		int _count = 0;

		// 删除与0相等的所有元素
		nums.erase(remove_if(nums.begin(), nums.end(), [&_count](int elem){ if (elem == 0){ ++_count; };  return elem == 0; }), nums.end());

		for (int i = 0; i < _count; ++i)
		{
			nums.push_back(0);
		}
	}
};

void main()
{
	Solution s;
	vector<int> vi{ 0, 1, 0, 3, 12 };
	cout << "原来容器中元素为：" << endl;
	copy(vi.begin(), vi.end(), ostream_iterator<int> (cout, " "));

	cout << endl;

	// 把值为0的所有元素移动到容器的后面
	s.moveZeroes(vi);

	cout << "调整后的容器元素为:" << endl;
	copy(vi.begin(), vi.end(), ostream_iterator<int> (cout, " "));

	cin.get();
}

运行结果：