# Move Zeros

## Description

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.

**Example:**

```
Input: [0,1,0,3,12]
Output: [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.

## Solutions

### My solution

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

### Longer but possibly faster solution

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