[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: You must do this in-place without making a copy of the array.
Minimize the total number of operations.

Solution：
利用双指针的方法，一个指针忽视0，一个指针不断往前，忽视0的指针利用不断往前的指针将0替换到按顺序的非0数。

class Solution {public:    void moveZeroes(vector<int>& nums) {        int j = 0;        // move all the nonzero elements advance        for (int i = 0; i < nums.size(); i++) {            if (nums[i] != 0) {                nums[j++] = nums[i];            }        }        for (;j < nums.size(); j++) {            nums[j] = 0;        }    }};