【LeetCode】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:

1. You must do this in-place without making a copy of the array.
2. Minimize the total number of operations.

题解：两指针，设置一个指针用来更新非零元素个数，一个用来遍历数组，以后注意类似的思想，不用直接从插入或交换入手，注意用两指针手法

void moveZeroes(vector<int>& nums) {
    int cnt=0;
    for(int i=0;i<nums.size();i++)
    {
        if(nums[i]!=0)nums[cnt++]=nums[i];
    }
    for(int i=cnt;i<nums.size();i++)
        nums[i]=0;
}