【LeetCode力扣热题100】【LeetCode 283】移动零

双指针，first指针指向结果序列的尾部+1，second指针依次遍历原序列，遇0跳过，非0则将指向的元素赋值给first指针指向的位置。最后，从first索引开始将后续的元素全部赋值为0。

class Solution {
public:void moveZeroes(vector<int>& nums) {int first = 0;int second = 0;while(second < nums.size()){if(nums[second]){nums[first++] = nums[second++];}else second++;}while(first < nums.size()){nums[first++] = 0;}}
};