[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.
2. Minimize the total number of operations.

Credits:

Special thanks to @jianchao.li.fighter for adding this problem and creating all test cases.

将数组中的0移动到最后，并保持其他数字的相对位置不变

AC代码：

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