Problema
Turn the centered pyramid over: the top row is the widest, with 2n − 1 stars, and each row below is two stars narrower and shifted one space further right, until the last row holds a single *. Row i (counting from 1) has i − 1 leading spaces followed by 2(n − i) + 1 stars.
Implement inverted_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 = 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 has 0 spaces and 5 stars, row 2 has 1 space and 3 stars, row 3 has 2 spaces and 1 star: ["*****", " ***", " *"].
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: ["*"].
Cómo abordarlo
Inténtalo primero por tu cuenta y luego abre las pistas una a una.
Pista 1
Write the rows for n = 3 and count the spaces and stars on each.
Pista 2
Spaces grow by one per row while stars shrink by two.
Pista 3
The last row always has exactly one 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.