Problème
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.
Contraintes
0 ≤ n ≤ 100
Exemples
Entrée :
n = 3
Sortie attendue :
expected = ["*****", " ***", " *"]
Entrée :
long long n = 3;
Sortie attendue :
std::vector<std::string> expected = {"*****", " ***", " *"};
Entrée :
long n = 3;
Sortie attendue :
string[] expected = new string[] {"*****", " ***", " *"};
Explication
Row 1 has 0 spaces and 5 stars, row 2 has 1 space and 3 stars, row 3 has 2 spaces and 1 star: ["*****", " ***", " *"].
Entrée :
n = 1
Sortie attendue :
expected = ["*"]
Entrée :
long long n = 1;
Sortie attendue :
std::vector<std::string> expected = {"*"};
Entrée :
long n = 1;
Sortie attendue :
string[] expected = new string[] {"*"};
Explication
One row with one star: ["*"].
Comment l'aborder
Essayez d'abord seul, puis ouvrez les indices un par un.
Indice 1
Write the rows for n = 3 and count the spaces and stars on each.
Indice 2
Spaces grow by one per row while stars shrink by two.
Indice 3
The last row always has exactly one star.
Complexité attendue
O(n^2) time, O(n^2) extra space
Références
Ce défi a été adapté pour CodeUtility. Suivez l'énoncé et les contraintes ci-dessus.