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:

You must do this in-place without making a copy of the array.
Minimize the total number of operations.

这样竟然不超时。

class Solution {
public:
void moveZeroes(vector<int>& nums) {
int len = nums.size();
bool haszero = true;
while(haszero){
haszero = false;
int i;
for(i = 0; i < len - 1; i ++){
if(nums[i] == 0){
haszero = true;
swap(nums[i], nums[i + 1]);
}
}
len --;
}
}
};