Условие
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
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. Следуйте условию и ограничениям выше.