Problema
Start from the solid right triangle where row i (counting from 1) is i characters wide, and keep only its border. Row i is all stars when i ≤ 2 or i = n (the top tip and the bottom edge). Any other row is a *, then i − 2 spaces, then a *.
Implement hollow_right_triangle(n).
Input
n: The number of rows.
Output
Return the rows from top to bottom. Every row ends with a star, so there are no trailing spaces.
Restricciones
0 ≤ n ≤ 100
Ejemplos
Entrada:
n = 5
Salida esperada:
expected = ["*", "**", "* *", "* *", "*****"]
Entrada:
long long n = 5;
Salida esperada:
std::vector<std::string> expected = {"*", "**", "* *", "* *", "*****"};
Entrada:
long n = 5;
Salida esperada:
string[] expected = new string[] {"*", "**", "* *", "* *", "*****"};
Explicación
Rows 3 and 4 are hollow and row 5 is the full bottom edge: ["*", "**", "* *", "* *", "*****"].
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 3 is the last row, so it is solid: ["*", "**", "***"].
Cómo abordarlo
Inténtalo primero por tu cuenta y luego abre las pistas una a una.
Pista 1
A row is solid when it is too short to have an inside, or when it is the last row.
Pista 2
Otherwise the row starts and ends with a star.
Pista 3
The number of spaces between the stars is the row length minus 2.
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.