問題
A centered pyramid has 1, 3, 5, … stars, and each row is pushed right with spaces so the peak sits in the middle. Row i (counting from 1) has n − i leading spaces followed by 2i − 1 stars. Nothing is printed after the last star.
Implement centered_star_pyramid(n).
Input
n: The number of rows (the height of the pyramid).
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 is 2 spaces and 1 star, row 2 is 1 space and 3 stars, row 3 is 5 stars: [" *", " ***", "*****"].
入力:
n = 1
期待される出力:
expected = ["*"]
入力:
long long n = 1;
期待される出力:
std::vector<std::string> expected = {"*"};
入力:
long n = 1;
期待される出力:
string[] expected = new string[] {"*"};
解説
One row with one star and no spaces: ["*"].
解き方のヒント
まずは自分で考えてから、ヒントを 1 つずつ開いてみましょう。
ヒント 1
Write down rows 1 to 3 for n = 3 and count spaces and stars on each.
ヒント 2
Spaces go down by one per row while stars go up by two.
ヒント 3
Only add spaces before the stars, never after.
目安の計算量
O(n^2) time, O(n^2) extra space
参考資料
この課題はCodeUtility用に調整されています。上記の説明と制約に従ってください。