Problema
Splitting data into fixed-size chunks is how programs page results, batch database writes or send data in packets.
Given a list and a chunk size, cut the list into consecutive chunks of exactly size values, in order. The last chunk holds whatever is left and may be shorter.
Implement split_into_chunks(values, size).
Input
values: The list to split.
size: The chunk size.
Output
Return the list of chunks. An empty list gives no chunks.
Restricciones
0 ≤ number of values ≤ 10,000
1 ≤ size ≤ 10,000
Ejemplos
Entrada:
size = 3
values = [1, 2, 3, 4, 5, 6, 7]
Salida esperada:
expected = [
[1, 2, 3],
[4, 5, 6],
[7]
]Entrada:
long long size = 3;
std::vector<long long> values = {1, 2, 3, 4, 5, 6, 7};
Salida esperada:
std::vector<std::vector<long long>> expected = {
{1, 2, 3},
{4, 5, 6},
{7}
};Entrada:
long size = 3;
long[] values = new long[] {1, 2, 3, 4, 5, 6, 7};
Salida esperada:
long[][] expected = new long[][] {
new long[] {1, 2, 3},
new long[] {4, 5, 6},
new long[] {7}
};Explicación
Groups of 3: [1, 2, 3] and [4, 5, 6], and the leftover 7 forms a last, shorter chunk.
Entrada:
size = 5
values = [8, 9]
Salida esperada:
expected = [
[8, 9]
]Entrada:
long long size = 5;
std::vector<long long> values = {8, 9};
Salida esperada:
std::vector<std::vector<long long>> expected = {
{8, 9}
};Entrada:
long size = 5;
long[] values = new long[] {8, 9};
Salida esperada:
long[][] expected = new long[][] {
new long[] {8, 9}
};Explicación
The size is larger than the list, so everything fits in one chunk: [[8, 9]].
Cómo abordarlo
Inténtalo primero por tu cuenta y luego abre las pistas una a una.
Pista 1
Start positions are 0, size, 2·size, and so on.
Pista 2
Take a slice from each start position up to start + size.
Pista 3
The last slice may be shorter, and an empty list gives no chunks at all.
Complejidad esperada
O(n) time, O(n) extra space
Referencias
Este reto está adaptado para CodeUtility. Sigue el enunciado y las restricciones indicadas arriba.