Problème
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.
Contraintes
0 ≤ n ≤ 100
Exemples
Entrée :
n = 5
Sortie attendue :
expected = ["*", "**", "* *", "* *", "*****"]
Entrée :
long long n = 5;
Sortie attendue :
std::vector<std::string> expected = {"*", "**", "* *", "* *", "*****"};
Entrée :
long n = 5;
Sortie attendue :
string[] expected = new string[] {"*", "**", "* *", "* *", "*****"};
Explication
Rows 3 and 4 are hollow and row 5 is the full bottom edge: ["*", "**", "* *", "* *", "*****"].
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 3 is the last row, so it is solid: ["*", "**", "***"].
Comment l'aborder
Essayez d'abord seul, puis ouvrez les indices un par un.
Indice 1
A row is solid when it is too short to have an inside, or when it is the last row.
Indice 2
Otherwise the row starts and ends with a star.
Indice 3
The number of spaces between the stars is the row length minus 2.
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.