Leetcode - Array - 283. Move Zeroes（两个指针除去所有0）

1. Problem Description

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.

 

2. My solution

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