Problema
Flip the right triangle: the first row is the longest, with n stars, and each following row has one star fewer, down to a single *. Counting the outer loop down instead of up is the whole trick.
Implement inverted_right_triangle(n).
Input
n: The number of rows.
Output
Return the rows from top to bottom. Row i (counting from 1) has n − i + 1 * characters.
Restricciones
0 ≤ n ≤ 100
Ejemplos
Entrada:
n = 4
Salida esperada:
expected = ["****", "***", "**", "*"]
Entrada:
long long n = 4;
Salida esperada:
std::vector<std::string> expected = {"****", "***", "**", "*"};
Entrada:
long n = 4;
Salida esperada:
string[] expected = new string[] {"****", "***", "**", "*"};
Explicación
Rows shrink 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
With one row the triangle is just ["*"].
Cómo abordarlo
Inténtalo primero por tu cuenta y luego abre las pistas una a una.
Pista 1
Let the outer loop count down from n to 1.
Pista 2
Each row has as many stars as the current loop value.
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.