Move Zeroes

You are given an integer array nums.

Your task is to move all the 0s to the end of the array while keeping the relative order of non-zero elements the same.

Important Rules:

1. You must do this in-place (no extra array allowed).

2. Try to minimize the number of operations.

Example 1

Input

nums = [0,1,0,3,12]

Output

[1,3,12,0,0]

Example 2

Input

nums = [0]

Output

[0]

Explanation (Simple):

• Take all non-zero numbers and shift them forward.

• Fill remaining positions with 0.

Constraints:

• 1 ≤ nums.length ≤ 10⁴

• -2³¹ ≤ nums[i] ≤ 2³¹ - 1