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.
Restricciones
0 ≤ n ≤ 100
Ejemplos
Entrada:
n = 3
Salida esperada:
expected = ["*", "**", "***"]
Entrada:
long long n = 3;
Salida esperada:
std::vector<std::string> expected = {"*", "**", "***"};
Entrada:
long n = 3;
Salida esperada:
string[] expected = new string[] {"*", "**", "***"};
Explicación
Rows grow by one star: "*", "**", "***".
Entrada:
n = 1
Salida esperada:
expected = ["*"]
Entrada:
long long n = 1;
Salida esperada:
std::vector<std::string> expected = {"*"};
Entrada:
long n = 1;
Salida esperada:
string[] expected = new string[] {"*"};
Explicación
A single row with one star: ["*"].
Cómo abordarlo
Inténtalo primero por tu cuenta y luego abre las pistas una a una.
Pista 1
Row i needs exactly i stars, so the row number is all you need.
Pista 2
Repeat the star character instead of adding one character at a time if your language allows it.
Pista 3
When n is 0, return an empty list.
Complejidad esperada
O(n^2) time, O(n^2) extra space
Referencias
Este reto está adaptado para CodeUtility. Sigue el enunciado y las restricciones indicadas arriba.