Problema
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.
Vincoli
0 ≤ n ≤ 100
Esempi
Input:
n = 3
Output atteso:
expected = ["*", "**", "***"]
Input:
long long n = 3;
Output atteso:
std::vector<std::string> expected = {"*", "**", "***"};
Input:
long n = 3;
Output atteso:
string[] expected = new string[] {"*", "**", "***"};
Spiegazione
Rows grow 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
A single row with one star: ["*"].
Come affrontarlo
Prova prima da solo, poi apri un suggerimento alla volta.
Suggerimento 1
Row i needs exactly i stars, so the row number is all you need.
Suggerimento 2
Repeat the star character instead of adding one character at a time if your language allows it.
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.