# Move Zeroes

## 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]&#x20;
>
> **Output:** \[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.

## **Code**

```java
class Solution {
    public void moveZeroes(int[] nums) {
        int moveStep = 0;
        for (int i = 0; i < nums.length; i++) {
            if (nums[i] == 0) {
                moveStep++;
                continue;
            }
            if (moveStep != 0) {
                nums[i - moveStep] = nums[i];
                nums[i] = 0;
            }
        }
    }
}
```
