LeetCode: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.

思路：依次遍历，不改变非0元素的次序。

代码：

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