Problème
A diamond is a centered pyramid with an upside-down copy below it that shares the widest row. For a given n the diamond has 2n − 1 rows. Number the rows k = 1 to 2n − 1 and let m = n − |n − k|, so m goes 1, 2, …, n, …, 2, 1. Row k has n − m leading spaces followed by 2m − 1 stars.
Implement diamond_pattern(n).
Input
n: The number of rows in the top half, including the widest middle row.
Output
Return the 2n − 1 rows from top to bottom, without trailing spaces. When n is 0, return an empty list.
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
Five rows with 1, 3, 5, 3, 1 stars and 2, 1, 0, 1, 2 leading spaces: [" *", " ***", "*****", " ***", " *"].
Entrée :
n = 2
Sortie attendue :
expected = [" *", "***", " *"]
Entrée :
long long n = 2;
Sortie attendue :
std::vector<std::string> expected = {" *", "***", " *"};
Entrée :
long n = 2;
Sortie attendue :
string[] expected = new string[] {" *", "***", " *"};
Explication
Three rows: one star after a space, three stars, one star after a space: [" *", "***", " *"].
Comment l'aborder
Essayez d'abord seul, puis ouvrez les indices un par un.
Indice 1
Draw the top half first; it is the centered pyramid you may already know.
Indice 2
The bottom half is the top half without its last row, in reverse order.
Indice 3
Alternatively, |n − k| tells you how far row k is from the middle row.
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.