問題
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.
制約
0 ≤ n ≤ 100
例
入力:
n = 4
期待される出力:
expected = ["****", "***", "**", "*"]
入力:
long long n = 4;
期待される出力:
std::vector<std::string> expected = {"****", "***", "**", "*"};
入力:
long n = 4;
期待される出力:
string[] expected = new string[] {"****", "***", "**", "*"};
解説
Rows shrink by one star: "****", "***", "**", "*".
入力:
n = 1
期待される出力:
expected = ["*"]
入力:
long long n = 1;
期待される出力:
std::vector<std::string> expected = {"*"};
入力:
long n = 1;
期待される出力:
string[] expected = new string[] {"*"};
解説
With one row the triangle is just ["*"].
解き方のヒント
まずは自分で考えてから、ヒントを 1 つずつ開いてみましょう。
ヒント 1
Let the outer loop count down from n to 1.
ヒント 2
Each row has as many stars as the current loop value.
ヒント 3
When n is 0, return an empty list.
目安の計算量
O(n^2) time, O(n^2) extra space
参考資料
この課題はCodeUtility用に調整されています。上記の説明と制約に従ってください。