leetcode283---Move Zeroes（把0移到数组后面）

问题描述：

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.

问题求解：

class Solution {
public:
void moveZeroes(vector<int>& nums) {
int n = nums.size();
int j=0;//记录非零元素
for(int i=0;i<n;i++)
{
if(nums[i] != 0)
{//将非零元素都放到前面
nums[j++] = nums[i];
}
}
for(;j<n;j++)
{//把后面空余的位置都设为0
nums[j] = 0;
}
}
};