Problème
Take the solid diamond with 2n − 1 rows: number the rows k = 1 to 2n − 1, let m = n − |n − k|, and give row k n − m leading spaces and a block of width 2m − 1. In the hollow version only the two ends of each block are * and everything between them is a space. A block of width 1 is a single *.
Implement hollow_diamond(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
Widths are 1, 3, 5, 3, 1; the width 3 and 5 rows keep only their end stars: [" *", " * *", "* *", " * *", " *"].
Entrée :
n = 1
Sortie attendue :
expected = ["*"]
Entrée :
long long n = 1;
Sortie attendue :
std::vector<std::string> expected = {"*"};
Entrée :
long n = 1;
Sortie attendue :
string[] expected = new string[] {"*"};
Explication
A single block of width 1: ["*"].
Comment l'aborder
Essayez d'abord seul, puis ouvrez les indices un par un.
Indice 1
Work out the width of each row exactly as for the solid diamond.
Indice 2
A row of width w has a star, w − 2 spaces and a star.
Indice 3
Check what that rule does when w is 1 and handle that row separately.
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.