Problème
Flip the right triangle: the first row is the longest, with n stars, and each following row has one star fewer, down to a single *. Counting the outer loop down instead of up is the whole trick.
Implement inverted_right_triangle(n).
Input
n: The number of rows.
Output
Return the rows from top to bottom. Row i (counting from 1) has n − i + 1 * characters.
Contraintes
0 ≤ n ≤ 100
Exemples
Entrée :
n = 4
Sortie attendue :
expected = ["****", "***", "**", "*"]
Entrée :
long long n = 4;
Sortie attendue :
std::vector<std::string> expected = {"****", "***", "**", "*"};
Entrée :
long n = 4;
Sortie attendue :
string[] expected = new string[] {"****", "***", "**", "*"};
Explication
Rows shrink by one 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
With one row the triangle is just ["*"].
Comment l'aborder
Essayez d'abord seul, puis ouvrez les indices un par un.
Indice 1
Let the outer loop count down from n to 1.
Indice 2
Each row has as many stars as the current loop value.
Indice 3
When n is 0, return an empty list.
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.