[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:

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

这道题是将数字0移动到数组尾部并保证其他数字顺序不变，题目难度为Easy。

遍历数组，将非0数字从数组头部依次写入数组，之后将剩余部分赋值为0即可完成数组的重排。具体代码：class Solution {
public:
void moveZeroes(vector<int>& nums) {
int idx = 0;
for(int n:nums) if(n) nums[idx++] = n;
while(idx<nums.size()) nums[idx++] = 0;
}
};