Problema
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.
Restrições
0 ≤ n ≤ 100
Exemplos
Entrada:
n = 3
Saída esperada:
expected = [" *", " * *", "* *", " * *", " *"]
Entrada:
long long n = 3;
Saída esperada:
std::vector<std::string> expected = {" *", " * *", "* *", " * *", " *"};
Entrada:
long n = 3;
Saída esperada:
string[] expected = new string[] {" *", " * *", "* *", " * *", " *"};
Explicação
Widths are 1, 3, 5, 3, 1; the width 3 and 5 rows keep only their end stars: [" *", " * *", "* *", " * *", " *"].
Entrada:
n = 1
Saída esperada:
expected = ["*"]
Entrada:
long long n = 1;
Saída esperada:
std::vector<std::string> expected = {"*"};
Entrada:
long n = 1;
Saída esperada:
string[] expected = new string[] {"*"};
Explicação
A single block of width 1: ["*"].
Como abordar
Tente sozinho primeiro e depois abra uma dica de cada vez.
Dica 1
Work out the width of each row exactly as for the solid diamond.
Dica 2
A row of width w has a star, w − 2 spaces and a star.
Dica 3
Check what that rule does when w is 1 and handle that row separately.
Complexidade esperada
O(n^2) time, O(n^2) extra space
Referências
Este desafio foi adaptado para o CodeUtility. Siga o enunciado e as restrições acima.