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.

简单的思路，双指针即可；不要傻傻的绕进去一个个的填坑。

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

while (lastNonZero < nums.size()) {
nums[lastNonZero++] = 0;
}
}
};