Problema
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.
Vincoli
0 ≤ n ≤ 100
Esempi
Input:
n = 4
Output atteso:
expected = ["****", "***", "**", "*"]
Input:
long long n = 4;
Output atteso:
std::vector<std::string> expected = {"****", "***", "**", "*"};
Input:
long n = 4;
Output atteso:
string[] expected = new string[] {"****", "***", "**", "*"};
Spiegazione
Rows shrink by one 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
With one row the triangle is just ["*"].
Come affrontarlo
Prova prima da solo, poi apri un suggerimento alla volta.
Suggerimento 1
Let the outer loop count down from n to 1.
Suggerimento 2
Each row has as many stars as the current loop value.
Suggerimento 3
When n is 0, return an empty list.
Complessità attesa
O(n^2) time, O(n^2) extra space
Riferimenti
Questa sfida è adattata per CodeUtility. Segui la traccia e i vincoli sopra.