問題
The right triangle is usually the first pattern program in an intro course: row 1 has one *, row 2 has two, and so on down to row n. The outer loop picks the row and the inner loop (or string repetition) builds it.
Implement right_triangle_stars(n).
Input
n: The number of rows.
Output
Return the rows from top to bottom. Row i (counting from 1) is i * characters with no spaces.
制約
0 ≤ n ≤ 100
例
入力:
n = 3
期待される出力:
expected = ["*", "**", "***"]
入力:
long long n = 3;
期待される出力:
std::vector<std::string> expected = {"*", "**", "***"};
入力:
long n = 3;
期待される出力:
string[] expected = new string[] {"*", "**", "***"};
解説
Rows grow by one star: "*", "**", "***".
入力:
n = 1
期待される出力:
expected = ["*"]
入力:
long long n = 1;
期待される出力:
std::vector<std::string> expected = {"*"};
入力:
long n = 1;
期待される出力:
string[] expected = new string[] {"*"};
解説
A single row with one star: ["*"].
解き方のヒント
まずは自分で考えてから、ヒントを 1 つずつ開いてみましょう。
ヒント 1
Row i needs exactly i stars, so the row number is all you need.
ヒント 2
Repeat the star character instead of adding one character at a time if your language allows it.
ヒント 3
When n is 0, return an empty list.
目安の計算量
O(n^2) time, O(n^2) extra space
参考資料
この課題はCodeUtility用に調整されています。上記の説明と制約に従ってください。