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:

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

算法：不能复制数组空间，从前往后统计数组中值为0的个数k，将数值不为0的往前移动K个位置，最后K个直接赋值为0

class Solution {
public:
    void moveZeroes(vector<int>& nums) {
        int i,k=0;
        for(i=0;i<nums.size();i++) {
            if(nums[i]==0) {
                k++;
            }
            else {
                nums[i-k] = nums[i];
            }
        }
        for(i=0;i<k;i++) {
            nums[nums.size()-1-i]=0;
        }
    }
};