MoveZeroes.cpp

//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:
//You must do this in-place without making a copy of the array.
//Minimize the total number of operations.
//Credits:
//Special thanks to @jianchao.li.fighter for adding this problem and creating all test cases.
//

#include<vector>

using namespace std;

class MoveZeroes {
public:
	void moveZeroes(vector<int>& nums) {
		int t = 0;
		for (size_t i = 0; i<nums.size(); ++i)
		{
			if (!nums[i])
			{
				t = i;
				while (t<nums.size() && !nums[t]) ++t;
				if (t<nums.size())
				{
					int tmp = nums[t];
					nums[t] = nums[i];
					nums[i] = tmp;
				}
				else
				{
					break;
				}
			}
		}


		//better
		//int j = 0;
		//// move all the nonzero elements advance
		//for (int i = 0; i < nums.size(); i++) {
		//	if (nums[i] != 0) {
		//		nums[j++] = nums[i];
		//	}
		//}
		//for (; j < nums.size(); j++) {
		//	nums[j] = 0;
		//}
	}
};