問題
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.
制約
0 ≤ n ≤ 100
例
入力:
n = 4
期待される出力:
expected = ["1", "2 3", "4 5 6", "7 8 9 10"]
入力:
long long n = 4;
期待される出力:
std::vector<std::string> expected = {"1", "2 3", "4 5 6", "7 8 9 10"};
入力:
long n = 4;
期待される出力:
string[] expected = new string[] {"1", "2 3", "4 5 6", "7 8 9 10"};
解説
The numbers 1 to 10 fill rows of length 1, 2, 3, 4: ["1", "2 3", "4 5 6", "7 8 9 10"].
入力:
n = 1
期待される出力:
expected = ["1"]
入力:
long long n = 1;
期待される出力:
std::vector<std::string> expected = {"1"};
入力:
long n = 1;
期待される出力:
string[] expected = new string[] {"1"};
解説
Only the first row: ["1"].
解き方のヒント
まずは自分で考えてから、ヒントを 1 つずつ開いてみましょう。
ヒント 1
Keep one counter that starts at 1 and never resets between rows.
ヒント 2
Row i takes the next i values of that counter.
ヒント 3
Join the numbers with single spaces so nothing trails at the end.
目安の計算量
O(n^2) time, O(n^2) extra space
参考資料
この課題はCodeUtility用に調整されています。上記の説明と制約に従ってください。