【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.
解答：

将所有的 0 挪到最后，此时的 0 不再需要单独标记，仅仅需要记录开始 0 出现的位置即可。

class Solution {
public:
void moveZeroes(vector<int>& nums) {
int length = nums.size();
int cursor = 0;
for(int i=0; i<length; i++)
{
if(nums[i] != 0)
{
nums[cursor] = nums[i];
cursor++;
}
}

for(int i=cursor; i<length; i++)
{
nums[i] = 0;
}
}
};