Leetcode283 Move Zeros

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.

Credits:
Special thanks to @jianchao.li.fighter for adding this problem and creating all test cases.

Subscribe to see which companies asked this question

解题思路：

此题是比较典型的“双指针”类题目，最优时间复杂度O(n)。从前向后依次复制非零数，最后将剩余部分清零

      

class Solution {
public:
    void moveZeroes(vector<int>& nums) {
        vector<int>::iterator it1=nums.begin();
        vector<int>::iterator it2=nums.begin();
        
        while(it2!=nums.end())
        {
            if(*it2!=0)
             {
                 *it1=*it2;
                 ++it1;
                 ++it2;
             }
            else
               it2++;
        }
        while(it1!=nums.end())
        {
            *it1=0;
            it1++;
            
        }
    }
};