Day 4 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.

Example:

Input: [0,1,0,3,12]
Output: [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.
本质上还是双指针

class Solution {
public:
    void moveZeroes(vector<int>& nums) {
        int a , b;
		int count = 0;
		for (int i = 0; i < nums.size(); i++) {
			if (nums[i]) 	swap(nums[count++],nums[i]);
		}
    }
	void swap(int &a, int &b){
		int tmp = a;
		a = b;
		b = tmp;
	}
};