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.

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.

代码：

class Solution {
public:
    void moveZeroes(vector<int>& nums) {
        int left = 0, right = 0, len = nums.size();
    while (right < len) {
        if (nums[right] != 0) {
            if (left != right){
                nums[left] = nums[right];
                nums[right] = 0;
            }
            left ++; 
        }
        right++;
    }
    }
};

思路：

双指针法