Problème
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.
Contraintes
0 ≤ n ≤ 100
Exemples
Entrée :
n = 3
Sortie attendue :
expected = ["*", "**", "***"]
Entrée :
long long n = 3;
Sortie attendue :
std::vector<std::string> expected = {"*", "**", "***"};
Entrée :
long n = 3;
Sortie attendue :
string[] expected = new string[] {"*", "**", "***"};
Explication
Rows grow by one star: "*", "**", "***".
Entrée :
n = 1
Sortie attendue :
expected = ["*"]
Entrée :
long long n = 1;
Sortie attendue :
std::vector<std::string> expected = {"*"};
Entrée :
long n = 1;
Sortie attendue :
string[] expected = new string[] {"*"};
Explication
A single row with one star: ["*"].
Comment l'aborder
Essayez d'abord seul, puis ouvrez les indices un par un.
Indice 1
Row i needs exactly i stars, so the row number is all you need.
Indice 2
Repeat the star character instead of adding one character at a time if your language allows it.
Indice 3
When n is 0, return an empty list.
Complexité attendue
O(n^2) time, O(n^2) extra space
Références
Ce défi a été adapté pour CodeUtility. Suivez l'énoncé et les contraintes ci-dessus.