Problème
Row i (counting from 1) of a centered pyramid has n − i leading spaces and a block of width 2i − 1. In the hollow version the last row (the base) stays fully filled with stars, a block of width 1 is a single *, and every other block keeps only its two end stars with spaces between them.
Implement hollow_pyramid(n).
Input
n: The number of rows.
Output
Return the rows from top to bottom, without trailing spaces.
Contraintes
0 ≤ n ≤ 100
Exemples
Entrée :
n = 4
Sortie attendue :
expected = [" *", " * *", " * *", "*******"]
Entrée :
long long n = 4;
Sortie attendue :
std::vector<std::string> expected = {" *", " * *", " * *", "*******"};
Entrée :
long n = 4;
Sortie attendue :
string[] expected = new string[] {" *", " * *", " * *", "*******"};
Explication
Rows 2 and 3 keep only their ends, row 4 is the solid base of 7 stars: [" *", " * *", " * *", "*******"].
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
Row 2 is the base, so it is solid: [" *", "***"].
Comment l'aborder
Essayez d'abord seul, puis ouvrez les indices un par un.
Indice 1
Leading spaces are the same as in the solid pyramid.
Indice 2
The tip has width 1 and the base is the last row; both are solid.
Indice 3
Any other row is a star, some spaces and a star.
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.