問題
A diamond is a centered pyramid with an upside-down copy below it that shares the widest row. For a given n the diamond has 2n − 1 rows. Number the rows k = 1 to 2n − 1 and let m = n − |n − k|, so m goes 1, 2, …, n, …, 2, 1. Row k has n − m leading spaces followed by 2m − 1 stars.
Implement diamond_pattern(n).
Input
n: The number of rows in the top half, including the widest middle row.
Output
Return the 2n − 1 rows from top to bottom, without trailing spaces. When n is 0, return an empty list.
制約
0 ≤ n ≤ 100
例
入力:
n = 3
期待される出力:
expected = [" *", " ***", "*****", " ***", " *"]
入力:
long long n = 3;
期待される出力:
std::vector<std::string> expected = {" *", " ***", "*****", " ***", " *"};
入力:
long n = 3;
期待される出力:
string[] expected = new string[] {" *", " ***", "*****", " ***", " *"};
解説
Five rows with 1, 3, 5, 3, 1 stars and 2, 1, 0, 1, 2 leading spaces: [" *", " ***", "*****", " ***", " *"].
入力:
n = 2
期待される出力:
expected = [" *", "***", " *"]
入力:
long long n = 2;
期待される出力:
std::vector<std::string> expected = {" *", "***", " *"};
入力:
long n = 2;
期待される出力:
string[] expected = new string[] {" *", "***", " *"};
解説
Three rows: one star after a space, three stars, one star after a space: [" *", "***", " *"].
解き方のヒント
まずは自分で考えてから、ヒントを 1 つずつ開いてみましょう。
ヒント 1
Draw the top half first; it is the centered pyramid you may already know.
ヒント 2
The bottom half is the top half without its last row, in reverse order.
ヒント 3
Alternatively, |n − k| tells you how far row k is from the middle row.
目安の計算量
O(n^2) time, O(n^2) extra space
参考資料
この課題はCodeUtility用に調整されています。上記の説明と制約に従ってください。