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.  

AC代码如下：（非最优，最坏情况下为O(n))

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

看了牛人的解法，自愧不如（时间复杂度O(n)):

class Solution {
public:
    void moveZeroes(vector<int>& nums) {
        int j = 0;
        // move all the nonzero elements advance
        for (int i = 0; i < nums.size(); i++) {
            if (nums[i] != 0) {
                nums[j++] = nums[i];
            }
        }
        for (;j < nums.size(); j++) {
            nums[j] = 0;
        }
    }
};