Problema
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.
Vincoli
0 ≤ n ≤ 26
Esempi
Input:
n = 4
Output atteso:
expected = ["A", "AB", "ABC", "ABCD"]
Input:
long long n = 4;
Output atteso:
std::vector<std::string> expected = {"A", "AB", "ABC", "ABCD"};
Input:
long n = 4;
Output atteso:
string[] expected = new string[] {"A", "AB", "ABC", "ABCD"};
Spiegazione
Each row adds the next letter: ["A", "AB", "ABC", "ABCD"].
Input:
n = 1
Output atteso:
expected = ["A"]
Input:
long long n = 1;
Output atteso:
std::vector<std::string> expected = {"A"};
Input:
long n = 1;
Output atteso:
string[] expected = new string[] {"A"};
Spiegazione
Only A: ["A"].
Come affrontarlo
Prova prima da solo, poi apri un suggerimento alla volta.
Suggerimento 1
Position j in a row (from 0) is the letter j places after A.
Suggerimento 2
Most languages let you add an integer to a character code and turn it back into a character.
Suggerimento 3
Row i is just row i − 1 with one more letter.
Complessità attesa
O(n^2) time, O(n^2) extra space
Riferimenti
Questa sfida è adattata per CodeUtility. Segui la traccia e i vincoli sopra.