Problema
Return the list with all zeros moved to the end. The non-zero values keep their relative order.
Implement move_zeroes(numbers).
Input
numbers: The list of integers.
Output
Return the rearranged list.
Restricciones
0 ≤ length ≤ 100,000
Ejemplos
Entrada:
numbers = [0, 1, 0, 3, 12]
Salida esperada:
expected = [1, 3, 12, 0, 0]
Entrada:
std::vector<long long> numbers = {0, 1, 0, 3, 12};
Salida esperada:
std::vector<long long> expected = {1, 3, 12, 0, 0};
Entrada:
long[] numbers = new long[] {0, 1, 0, 3, 12};
Salida esperada:
long[] expected = new long[] {1, 3, 12, 0, 0};
Explicación
1, 3, 12 keep their order and the two zeros go last: [1, 3, 12, 0, 0].
Entrada:
numbers = [0, 0]
Salida esperada:
expected = [0, 0]
Entrada:
std::vector<long long> numbers = {0, 0};
Salida esperada:
std::vector<long long> expected = {0, 0};
Entrada:
long[] numbers = new long[] {0, 0};
Salida esperada:
long[] expected = new long[] {0, 0};
Explicación
Only zeros: the list stays [0, 0].
Cómo abordarlo
Inténtalo primero por tu cuenta y luego abre las pistas una a una.
Pista 1
Non-zero values should keep their order while zeros drift to the end.
Pista 2
A two-pointer or write-index approach lets you rebuild the list in one pass.
Pista 3
Do not reorder the non-zero values when compacting them.
Complejidad esperada
O(n) time, O(1) extra space
Referencias
Este reto está adaptado para CodeUtility. Sigue el enunciado y las restricciones indicadas arriba.