Problème
Floyd's triangle fills rows of growing length with consecutive integers starting at 1: row 1 holds 1, row 2 holds 2 3, row 3 holds 4 5 6, and so on. Row i (counting from 1) holds i numbers, and the first number of each row continues right after the last number of the row above.
Implement floyds_triangle(n).
Input
n: The number of rows.
Output
Return the rows from top to bottom. Inside a row, the numbers are written in decimal and separated by exactly one space, with no leading or trailing spaces.
Contraintes
0 ≤ n ≤ 100
Exemples
Entrée :
n = 4
Sortie attendue :
expected = ["1", "2 3", "4 5 6", "7 8 9 10"]
Entrée :
long long n = 4;
Sortie attendue :
std::vector<std::string> expected = {"1", "2 3", "4 5 6", "7 8 9 10"};
Entrée :
long n = 4;
Sortie attendue :
string[] expected = new string[] {"1", "2 3", "4 5 6", "7 8 9 10"};
Explication
The numbers 1 to 10 fill rows of length 1, 2, 3, 4: ["1", "2 3", "4 5 6", "7 8 9 10"].
Entrée :
n = 1
Sortie attendue :
expected = ["1"]
Entrée :
long long n = 1;
Sortie attendue :
std::vector<std::string> expected = {"1"};
Entrée :
long n = 1;
Sortie attendue :
string[] expected = new string[] {"1"};
Explication
Only the first row: ["1"].
Comment l'aborder
Essayez d'abord seul, puis ouvrez les indices un par un.
Indice 1
Keep one counter that starts at 1 and never resets between rows.
Indice 2
Row i takes the next i values of that counter.
Indice 3
Join the numbers with single spaces so nothing trails at the end.
Complexité attendue
O(n^2) time, O(n^2) extra space
Références
Ce défi a été adapté pour CodeUtility. Suivez l'énoncé et les contraintes ci-dessus.