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.

class Solution {
public:
    void moveZeroes(vector<int>& nums) {
        int log = 0; //索引0元素位置
        int logNO = 0;  //索引非0应放元素位置
        while (log<nums.size()) {
            if (nums[log]!=0) {
                swap(nums[logNO], nums[log]);
                logNO++;
            }
            log++;
        }
    }
};