Problema
An hourglass narrows from 2n − 1 stars down to a single star in the middle row and then widens back out. It has 2n − 1 rows. Number the rows k = 1 to 2n − 1 and let d = |n − k| (so d goes n − 1, …, 1, 0, 1, …, n − 1). Row k has n − 1 − d leading spaces followed by 2d + 1 stars.
Implement hourglass_pattern(n).
Input
n: The number of rows in the top half, including the middle row.
Output
Return the 2n − 1 rows from top to bottom, without trailing spaces. When n is 0, return an empty list.
Restricciones
0 ≤ n ≤ 100
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
Star counts are 5, 3, 1, 3, 5 and leading spaces 0, 1, 2, 1, 0: ["*****", " ***", " *", " ***", "*****"].
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
Only the waist: ["*"].
Cómo abordarlo
Inténtalo primero por tu cuenta y luego abre las pistas una a una.
Pista 1
The middle row has one star and n − 1 leading spaces.
Pista 2
The farther a row is from the middle, the more stars and the fewer spaces it has.
Pista 3
Count the rows: there are 2n − 1, not 2n.
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.