283. Move Zeroes

题目来源【Leetcode】

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.

这道题要求不再开一个数组来操作，直接在nums里面进行操作，那么就从第一个数开始，如果不等于0的话就把它往前面放，用cur来计数（不为0的数字个数），最后将cur及以后的数全变为0；

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