問題
Two staircases of height n stand back to back with a gap between them, like the facing pyramids in an old platform game. Row i (counting from 1) has n − i leading spaces, then i # characters, then exactly two spaces, then i more # characters. The left staircase is aligned to the right edge and the right one to the left edge.
Implement double_staircase(n).
Input
n: The height of each staircase.
Output
Return the rows from top to bottom. Every row ends with a #, so there are no trailing spaces.
制約
0 ≤ n ≤ 50
例
入力:
n = 3
期待される出力:
expected = [" # #", " ## ##", "### ###"]
入力:
long long n = 3;
期待される出力:
std::vector<std::string> expected = {" # #", " ## ##", "### ###"};
入力:
long n = 3;
期待される出力:
string[] expected = new string[] {" # #", " ## ##", "### ###"};
解説
Row 1 is 2 spaces, #, 2 spaces, #; row 3 has no leading spaces: [" # #", " ## ##", "### ###"].
入力:
n = 1
期待される出力:
expected = ["# #"]
入力:
long long n = 1;
期待される出力:
std::vector<std::string> expected = {"# #"};
入力:
long n = 1;
期待される出力:
string[] expected = new string[] {"# #"};
解説
One block on each side of the gap: ["# #"].
解き方のヒント
まずは自分で考えてから、ヒントを 1 つずつ開いてみましょう。
ヒント 1
Build the left staircase first: it is a right-aligned triangle.
ヒント 2
The gap is always exactly two spaces.
ヒント 3
The right staircase has the same width as the left one on the same row and needs no padding after it.
目安の計算量
O(n^2) time, O(n^2) extra space
参考資料
この課題はCodeUtility用に調整されています。上記の説明と制約に従ってください。