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

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元素移至数组最后，且不改变非0元素的顺序，要求不能新辟数组。可以设置两个指针，一个固定0元素处，另一个遍历数组寻找非0元素，进行交换，直到遍历完整个数组即可。

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