文章作者：Tyan
博客：noahsnail.com  |  CSDN  |  简书

1. Description

Move Zeroes

2. Solution

• Version 1

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

• Version 2

class Solution {
public:
    void moveZeroes(vector<int>& nums) {
        int index = 0;
        for(int i = 0; i < nums.size(); i++) {
            if(nums[i] != 0) {
                swap(nums[i], nums[index]);
                index++;
            }
        }
    }
    
private:
    void swap(int& a, int& b) {
        int temp = a;
        a = b;
        b = temp;
    }
};

Reference

1. https://leetcode.com/problems/move-zeroes/description/