Problème
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.
Contraintes
0 ≤ number of values ≤ 10,000
1 ≤ size ≤ 10,000
Exemples
Entrée :
size = 3
values = [1, 2, 3, 4, 5, 6, 7]
Sortie attendue :
expected = [
[1, 2, 3],
[4, 5, 6],
[7]
]Entrée :
long long size = 3;
std::vector<long long> values = {1, 2, 3, 4, 5, 6, 7};
Sortie attendue :
std::vector<std::vector<long long>> expected = {
{1, 2, 3},
{4, 5, 6},
{7}
};Entrée :
long size = 3;
long[] values = new long[] {1, 2, 3, 4, 5, 6, 7};
Sortie attendue :
long[][] expected = new long[][] {
new long[] {1, 2, 3},
new long[] {4, 5, 6},
new long[] {7}
};Explication
Groups of 3: [1, 2, 3] and [4, 5, 6], and the leftover 7 forms a last, shorter chunk.
Entrée :
size = 5
values = [8, 9]
Sortie attendue :
expected = [
[8, 9]
]Entrée :
long long size = 5;
std::vector<long long> values = {8, 9};
Sortie attendue :
std::vector<std::vector<long long>> expected = {
{8, 9}
};Entrée :
long size = 5;
long[] values = new long[] {8, 9};
Sortie attendue :
long[][] expected = new long[][] {
new long[] {8, 9}
};Explication
The size is larger than the list, so everything fits in one chunk: [[8, 9]].
Comment l'aborder
Essayez d'abord seul, puis ouvrez les indices un par un.
Indice 1
Start positions are 0, size, 2·size, and so on.
Indice 2
Take a slice from each start position up to start + size.
Indice 3
The last slice may be shorter, and an empty list gives no chunks at all.
Complexité attendue
O(n) time, O(n) extra space
Références
Ce défi a été adapté pour CodeUtility. Suivez l'énoncé et les contraintes ci-dessus.