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

Note:

1. You must do this in-place without making a copy of the array.

1. Minimize the total number of operations.

挪位，建立一个标识，从头到尾遍历，非零则填充到标识中，然后将其余的置为0

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