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.
Credits:
Special thanks to @jianchao.li.fighter for adding this problem and creating all test cases.

Subscribe to see which companies asked this question.

---

思路

一前一后两个指针，遍历将不是零的从头开始排，再把后面的全部置0

---

代码

class Solution {
public:
    void moveZeroes(vector<int>& nums) {
        //将不是0的按序从头重拍，再把后面的全部置0
        size_t length = nums.size();
        size_t preIndex = 0;
        size_t laterIndex = 0;

        while(laterIndex < length)
        {
            if(nums[laterIndex] != 0)
            {
                nums[preIndex] = nums[laterIndex];
                preIndex++;
            }

            laterIndex++;
        }

        while(preIndex < length)
        {
            nums[preIndex] = 0;
            preIndex++;
        }
    }
};