Problema
Mostra traduzioneReturn 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.
Vincoli
0 ≤ length ≤ 100,000
Esempi
Esempio 1
Input:
numbers = [0, 1, 0, 3, 12]
Output atteso:
expected = [1, 3, 12, 0, 0]Input:
std::vector<long long> numbers = {0, 1, 0, 3, 12};
Output atteso:
std::vector<long long> expected = {1, 3, 12, 0, 0};Input:
long[] numbers = new long[] {0, 1, 0, 3, 12};
Output atteso:
long[] expected = new long[] {1, 3, 12, 0, 0};Spiegazione
1, 3, 12 keep their order and the two zeros go last: [1, 3, 12, 0, 0].
Esempio 2
Input:
numbers = [0, 0]
Output atteso:
expected = [0, 0]Input:
std::vector<long long> numbers = {0, 0};
Output atteso:
std::vector<long long> expected = {0, 0};Input:
long[] numbers = new long[] {0, 0};
Output atteso:
long[] expected = new long[] {0, 0};Spiegazione
Only zeros: the list stays [0, 0].
Riferimenti
Questa sfida è adattata per CodeUtility. Segui la traccia e i vincoli sopra.