LeetCode Algorithms #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.
2. Minimize the total number of operations.

思路：

略

解：

class Solution {public:    void moveZeroes(vector<int>& nums) {        if(nums.size() == 0)            return;        auto fromBegin = nums.begin();        while(fromBegin < nums.end())        {               if(*fromBegin == 0)            {                auto tempiterator = fromBegin;                while (tempiterator < nums.end())                {                    if(*tempiterator != 0)                    {                        *fromBegin = *tempiterator;                        *tempiterator = 0;                        break;                    }                    tempiterator++;                }                if(tempiterator == nums.end())                    return;            }            fromBegin++;        }    }};