Problema
Start from the solid right triangle where row i (counting from 1) is i characters wide, and keep only its border. Row i is all stars when i ≤ 2 or i = n (the top tip and the bottom edge). Any other row is a *, then i − 2 spaces, then a *.
Implement hollow_right_triangle(n).
Input
n: The number of rows.
Output
Return the rows from top to bottom. Every row ends with a star, so there are no trailing spaces.
Vincoli
0 ≤ n ≤ 100
Esempi
Input:
n = 5
Output atteso:
expected = ["*", "**", "* *", "* *", "*****"]
Input:
long long n = 5;
Output atteso:
std::vector<std::string> expected = {"*", "**", "* *", "* *", "*****"};
Input:
long n = 5;
Output atteso:
string[] expected = new string[] {"*", "**", "* *", "* *", "*****"};
Spiegazione
Rows 3 and 4 are hollow and row 5 is the full bottom edge: ["*", "**", "* *", "* *", "*****"].
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 3 is the last row, so it is solid: ["*", "**", "***"].
Come affrontarlo
Prova prima da solo, poi apri un suggerimento alla volta.
Suggerimento 1
A row is solid when it is too short to have an inside, or when it is the last row.
Suggerimento 2
Otherwise the row starts and ends with a star.
Suggerimento 3
The number of spaces between the stars is the row length minus 2.
Complessità attesa
O(n^2) time, O(n^2) extra space
Riferimenti
Questa sfida è adattata per CodeUtility. Segui la traccia e i vincoli sopra.