問題
Instead of stars, this right triangle uses the alphabet. Row i (counting from 1) holds the first i uppercase English letters in order, written next to each other with no spaces: row 1 is A, row 2 is AB, row 3 is ABC. Turning a position into a letter is a matter of adding it to the character code of A.
Implement alphabet_triangle(n).
Input
n: The number of rows (at most 26, one per letter).
Output
Return the rows from top to bottom.
制約
0 ≤ n ≤ 26
例
入力:
n = 4
期待される出力:
expected = ["A", "AB", "ABC", "ABCD"]
入力:
long long n = 4;
期待される出力:
std::vector<std::string> expected = {"A", "AB", "ABC", "ABCD"};
入力:
long n = 4;
期待される出力:
string[] expected = new string[] {"A", "AB", "ABC", "ABCD"};
解説
Each row adds the next letter: ["A", "AB", "ABC", "ABCD"].
入力:
n = 1
期待される出力:
expected = ["A"]
入力:
long long n = 1;
期待される出力:
std::vector<std::string> expected = {"A"};
入力:
long n = 1;
期待される出力:
string[] expected = new string[] {"A"};
解説
Only A: ["A"].
解き方のヒント
まずは自分で考えてから、ヒントを 1 つずつ開いてみましょう。
ヒント 1
Position j in a row (from 0) is the letter j places after A.
ヒント 2
Most languages let you add an integer to a character code and turn it back into a character.
ヒント 3
Row i is just row i − 1 with one more letter.
目安の計算量
O(n^2) time, O(n^2) extra space
参考資料
この課題はCodeUtility用に調整されています。上記の説明と制約に従ってください。