Problema
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.
Vincoli
0 ≤ n ≤ 100
Esempi
Input:
n = 4
Output atteso:
expected = ["1", "2 3", "4 5 6", "7 8 9 10"]
Input:
long long n = 4;
Output atteso:
std::vector<std::string> expected = {"1", "2 3", "4 5 6", "7 8 9 10"};
Input:
long n = 4;
Output atteso:
string[] expected = new string[] {"1", "2 3", "4 5 6", "7 8 9 10"};
Spiegazione
The numbers 1 to 10 fill rows of length 1, 2, 3, 4: ["1", "2 3", "4 5 6", "7 8 9 10"].
Input:
n = 1
Output atteso:
expected = ["1"]
Input:
long long n = 1;
Output atteso:
std::vector<std::string> expected = {"1"};
Input:
long n = 1;
Output atteso:
string[] expected = new string[] {"1"};
Spiegazione
Only the first row: ["1"].
Come affrontarlo
Prova prima da solo, poi apri un suggerimento alla volta.
Suggerimento 1
Keep one counter that starts at 1 and never resets between rows.
Suggerimento 2
Row i takes the next i values of that counter.
Suggerimento 3
Join the numbers with single spaces so nothing trails at the end.
Complessità attesa
O(n^2) time, O(n^2) extra space
Riferimenti
Questa sfida è adattata per CodeUtility. Segui la traccia e i vincoli sopra.