Leetcode #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].

class Solution {
public:
    void moveZeroes(vector<int>& nums) {
        vector<int>::iterator front, behind;
    	for(front = behind = nums.begin(); behind != nums.end(); ++ behind)
    	{
    		if(0 != *behind)
    		{
    		    int temp = *front;
    			*front = *behind;
    			*behind = temp;
    			++ front;
    		}
    	}
    	/*if(front != behind)
    		nums.erase(front, behind);*/
    }
};

最后并不需要把后面的0删掉