Leetcode 283 level 0

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.

Credits:

Special thanks to @jianchao.li.fighter for adding this problem and creating all test cases.

Answers:

Space O(1) Time O(n)

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