Problema
Row i (counting from 1) of a centered pyramid has n − i leading spaces and a block of width 2i − 1. In the hollow version the last row (the base) stays fully filled with stars, a block of width 1 is a single *, and every other block keeps only its two end stars with spaces between them.
Implement hollow_pyramid(n).
Input
n: The number of rows.
Output
Return the rows from top to bottom, without trailing spaces.
Restricciones
0 ≤ n ≤ 100
Ejemplos
Entrada:
n = 4
Salida esperada:
expected = [" *", " * *", " * *", "*******"]
Entrada:
long long n = 4;
Salida esperada:
std::vector<std::string> expected = {" *", " * *", " * *", "*******"};
Entrada:
long n = 4;
Salida esperada:
string[] expected = new string[] {" *", " * *", " * *", "*******"};
Explicación
Rows 2 and 3 keep only their ends, row 4 is the solid base of 7 stars: [" *", " * *", " * *", "*******"].
Entrada:
n = 2
Salida esperada:
expected = [" *", "***"]
Entrada:
long long n = 2;
Salida esperada:
std::vector<std::string> expected = {" *", "***"};
Entrada:
long n = 2;
Salida esperada:
string[] expected = new string[] {" *", "***"};
Explicación
Row 2 is the base, so it is solid: [" *", "***"].
Cómo abordarlo
Inténtalo primero por tu cuenta y luego abre las pistas una a una.
Pista 1
Leading spaces are the same as in the solid pyramid.
Pista 2
The tip has width 1 and the base is the last row; both are solid.
Pista 3
Any other row is a star, some spaces and a star.
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.