[LeetCode]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.

解题思路:

类似于Remove Elements。

class Solution {
public:
    void moveZeroes(vector<int>& nums) {
        int n = nums.size();
        int j = 0;
        for (int i = 0; i < n; ++i) {
            if (nums[i] != 0) {
                nums[j++] = nums[i];
            }
        }
        
        if (j != 0) {
            fill(nums.begin() + j, nums.end(), 0);
        }
    }
};