Problème
Build one row of a multiplication table: number × 1, number × 2, … up to number × count.
Implement multiplication_row(number, count).
Input
number: The number to multiply. count: How many multiples to list.
Output
Return the list of multiples in order.
Contraintes
-1,000 ≤ number ≤ 1,000; 0 ≤ count ≤ 100
Exemples
Exemple 1
Entrée :
count = 5
number = 3
Sortie attendue :
expected = [3, 6, 9, 12, 15]Entrée :
long long count = 5;
long long number = 3;
Sortie attendue :
std::vector<long long> expected = {3, 6, 9, 12, 15};Entrée :
long count = 5;
long number = 3;
Sortie attendue :
long[] expected = new long[] {3, 6, 9, 12, 15};Explication
3×1, 3×2, 3×3, 3×4, 3×5 = 3, 6, 9, 12, 15.
Exemple 2
Entrée :
count = 0
number = 7
Sortie attendue :
expected = []Entrée :
long long count = 0;
long long number = 7;
Sortie attendue :
std::vector<long long> expected = {};Entrée :
long count = 0;
long number = 7;
Sortie attendue :
long[] expected = new long[] {};Explication
Zero multiples were requested, so the list is empty.
Références
Ce défi a été adapté pour CodeUtility. Suivez l'énoncé et les contraintes ci-dessus.