[Array]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.

 

Credits:
Special thanks to @jianchao.li.fighter for adding this problem and creating all test cases.

思路：将数组中所有的0移动到末尾，遍历数组nums，然后将非零值放进nums前面的位置，之后将后面的位置全部置0.

优秀代码：

void movezeroes(vector<int>& nums){
int n = nums.size(), j = 0;
for(size_t i = 0; i < n; i++){
if(nums[i] != 0){
nums[j++] = nums[i];
}
}
for(;, j< n; j++){ //最前面的条件没有写，表示继续上面第一个for的j
nums[j] = 0;
}
}