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.
Vincoli
0 ≤ n ≤ 100
Esempi
Input:
n = 3
Output atteso:
expected = ["*****", " ***", " *"]
Input:
long long n = 3;
Output atteso:
std::vector<std::string> expected = {"*****", " ***", " *"};
Input:
long n = 3;
Output atteso:
string[] expected = new string[] {"*****", " ***", " *"};
Spiegazione
Row 1 has 0 spaces and 5 stars, row 2 has 1 space and 3 stars, row 3 has 2 spaces and 1 star: ["*****", " ***", " *"].
Input:
n = 1
Output atteso:
expected = ["*"]
Input:
long long n = 1;
Output atteso:
std::vector<std::string> expected = {"*"};
Input:
long n = 1;
Output atteso:
string[] expected = new string[] {"*"};
Spiegazione
One row with one star: ["*"].
Come affrontarlo
Prova prima da solo, poi apri un suggerimento alla volta.
Suggerimento 1
Write the rows for n = 3 and count the spaces and stars on each.
Suggerimento 2
Spaces grow by one per row while stars shrink by two.
Suggerimento 3
The last row always has exactly one star.
Complessità attesa
O(n^2) time, O(n^2) extra space
Riferimenti
Questa sfida è adattata per CodeUtility. Segui la traccia e i vincoli sopra.