【Leetcode算法】- Move Zeroes

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.
Credits:
Special thanks to @jianchao.li.fighter for adding this problem and creating all test cases.
链接：https://leetcode.com/problems/move-zeroes/

方法一:

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

备注:可能代码不规范,我是顺便学C++