[LeetCode] Move Zeroe

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.

将一个数组中的0全部移到最后，且保证非0数的前后次序不变。先将所有非0数字移到数组的前面，引入一个临时变量，记录最后一个非0变量的位置。之后把后面的数字全部更新成0即可。

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

[LeetCode] Move Zeroe

原文：http://www.cnblogs.com/immjc/p/7154572.html