Problems > Zeros to the Back

Zeros to the Back

Difficulty: 900 3000 ms 128 MB

implementation

Move every 0 to the end of the list, keeping the relative order of the non-zero values.

Input: the first line has N; the second line has N integers.

Output: the rearranged list.

Constraints:

  • 1 ≤ N ≤ 105
  • −109 ≤ ai ≤ 109

Sample Tests

Input 1
5
0 1 0 3 12
Output 1
1 3 12 0 0
Input 2
2
0 0
Output 2
0 0

Read the Editorial

Discussion (opens after you solve — no spoilers before)

No comments yet.

Submit Your Solution

Log in or create a free account to run and submit code.