問題
Turn the centered pyramid over: the top row is the widest, with 2n − 1 stars, and each row below is two stars narrower and shifted one space further right, until the last row holds a single *. Row i (counting from 1) has i − 1 leading spaces followed by 2(n − i) + 1 stars.
Implement inverted_pyramid(n).
Input
n: The number of rows.
Output
Return the rows from top to bottom, without trailing spaces.
制約
0 ≤ n ≤ 100
例
入力:
n = 3
期待される出力:
expected = ["*****", " ***", " *"]
入力:
long long n = 3;
期待される出力:
std::vector<std::string> expected = {"*****", " ***", " *"};
入力:
long n = 3;
期待される出力:
string[] expected = new string[] {"*****", " ***", " *"};
解説
Row 1 has 0 spaces and 5 stars, row 2 has 1 space and 3 stars, row 3 has 2 spaces and 1 star: ["*****", " ***", " *"].
入力:
n = 1
期待される出力:
expected = ["*"]
入力:
long long n = 1;
期待される出力:
std::vector<std::string> expected = {"*"};
入力:
long n = 1;
期待される出力:
string[] expected = new string[] {"*"};
解説
One row with one star: ["*"].
解き方のヒント
まずは自分で考えてから、ヒントを 1 つずつ開いてみましょう。
ヒント 1
Write the rows for n = 3 and count the spaces and stars on each.
ヒント 2
Spaces grow by one per row while stars shrink by two.
ヒント 3
The last row always has exactly one star.
目安の計算量
O(n^2) time, O(n^2) extra space
参考資料
この課題はCodeUtility用に調整されています。上記の説明と制約に従ってください。