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.
Vincoli
0 ≤ n ≤ 50
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
Top half: "* *", "** **", "******"; the bottom half is the same three rows reversed.
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
Each half is one row of 1 + 0 + 1 characters: ["**", "**"].
Come affrontarlo
Prova prima da solo, poi apri un suggerimento alla volta.
Suggerimento 1
In the top half, row i has i stars on each side.
Suggerimento 2
The gap shrinks by two each row and is empty on row n.
Suggerimento 3
The bottom half is the top half in reverse, including row n again.
Complessità attesa
O(n^2) time, O(n^2) extra space
Riferimenti
Questa sfida è adattata per CodeUtility. Segui la traccia e i vincoli sopra.