Problema
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.
Restricciones
0 ≤ n ≤ 100
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
Five rows with 1, 3, 5, 3, 1 stars and 2, 1, 0, 1, 2 leading spaces: [" *", " ***", "*****", " ***", " *"].
Entrada:
n = 2
Salida esperada:
expected = [" *", "***", " *"]
Entrada:
long long n = 2;
Salida esperada:
std::vector<std::string> expected = {" *", "***", " *"};
Entrada:
long n = 2;
Salida esperada:
string[] expected = new string[] {" *", "***", " *"};
Explicación
Three rows: one star after a space, three stars, one star after a space: [" *", "***", " *"].
Cómo abordarlo
Inténtalo primero por tu cuenta y luego abre las pistas una a una.
Pista 1
Draw the top half first; it is the centered pyramid you may already know.
Pista 2
The bottom half is the top half without its last row, in reverse order.
Pista 3
Alternatively, |n − k| tells you how far row k is from the middle row.
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.