Problema
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.
Restricciones
0 ≤ n ≤ 50
Ejemplos
Entrada:
n = 3
Salida esperada:
expected = [" # #", " ## ##", "### ###"]
Entrada:
long long n = 3;
Salida esperada:
std::vector<std::string> expected = {" # #", " ## ##", "### ###"};
Entrada:
long n = 3;
Salida esperada:
string[] expected = new string[] {" # #", " ## ##", "### ###"};
Explicación
Row 1 is 2 spaces, #, 2 spaces, #; row 3 has no leading spaces: [" # #", " ## ##", "### ###"].
Entrada:
n = 1
Salida esperada:
expected = ["# #"]
Entrada:
long long n = 1;
Salida esperada:
std::vector<std::string> expected = {"# #"};
Entrada:
long n = 1;
Salida esperada:
string[] expected = new string[] {"# #"};
Explicación
One block on each side of the gap: ["# #"].
Cómo abordarlo
Inténtalo primero por tu cuenta y luego abre las pistas una a una.
Pista 1
Build the left staircase first: it is a right-aligned triangle.
Pista 2
The gap is always exactly two spaces.
Pista 3
The right staircase has the same width as the left one on the same row and needs no padding after it.
Complejidad esperada
O(n^2) time, O(n^2) extra space
Referencias
Este reto está adaptado para CodeUtility. Sigue el enunciado y las restricciones indicadas arriba.