Problema
The butterfly has 2n rows. In the top half, row i (i = 1 to n) is i stars, then 2(n − i) spaces, then i stars again, so the two wings meet in the middle on row n. The bottom half repeats the same rows in reverse order, from i = n back down to i = 1, so the widest row appears twice in the middle.
Implement butterfly_pattern(n).
Input
n: The number of rows in each half.
Output
Return the 2n rows from top to bottom. Every row ends with a star, so no row has trailing spaces. When n is 0, return an empty list.
Restricciones
0 ≤ n ≤ 50
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
Top half: "* *", "** **", "******"; the bottom half is the same three rows reversed.
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
Each half is one row of 1 + 0 + 1 characters: ["**", "**"].
Cómo abordarlo
Inténtalo primero por tu cuenta y luego abre las pistas una a una.
Pista 1
In the top half, row i has i stars on each side.
Pista 2
The gap shrinks by two each row and is empty on row n.
Pista 3
The bottom half is the top half in reverse, including row n again.
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.