[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.

Example:

Input: [0,1,0,3,12]
Output: [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.

思路：从头扫到尾，记录当前已经出现的0的数目c，每当出现一个0就把当前当前非0的a[i]赋值给a[i-c]。

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

刷题尚未成功，同志仍需努力，与诸君共勉。