Problema
A centered pyramid has 1, 3, 5, … stars, and each row is pushed right with spaces so the peak sits in the middle. Row i (counting from 1) has n − i leading spaces followed by 2i − 1 stars. Nothing is printed after the last star.
Implement centered_star_pyramid(n).
Input
n: The number of rows (the height of the pyramid).
Output
Return the rows from top to bottom, without trailing spaces.
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
Row 1 is 2 spaces and 1 star, row 2 is 1 space and 3 stars, row 3 is 5 stars: [" *", " ***", "*****"].
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 row with one star and no spaces: ["*"].
Cómo abordarlo
Inténtalo primero por tu cuenta y luego abre las pistas una a una.
Pista 1
Write down rows 1 to 3 for n = 3 and count spaces and stars on each.
Pista 2
Spaces go down by one per row while stars go up by two.
Pista 3
Only add spaces before the stars, never after.
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.