Problema
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.
Vincoli
0 ≤ n ≤ 100
Esempi
Input:
n = 4
Output atteso:
expected = [" *", " * *", " * *", "*******"]
Input:
long long n = 4;
Output atteso:
std::vector<std::string> expected = {" *", " * *", " * *", "*******"};
Input:
long n = 4;
Output atteso:
string[] expected = new string[] {" *", " * *", " * *", "*******"};
Spiegazione
Rows 2 and 3 keep only their ends, row 4 is the solid base of 7 stars: [" *", " * *", " * *", "*******"].
Input:
n = 2
Output atteso:
expected = [" *", "***"]
Input:
long long n = 2;
Output atteso:
std::vector<std::string> expected = {" *", "***"};
Input:
long n = 2;
Output atteso:
string[] expected = new string[] {" *", "***"};
Spiegazione
Row 2 is the base, so it is solid: [" *", "***"].
Come affrontarlo
Prova prima da solo, poi apri un suggerimento alla volta.
Suggerimento 1
Leading spaces are the same as in the solid pyramid.
Suggerimento 2
The tip has width 1 and the base is the last row; both are solid.
Suggerimento 3
Any other row is a star, some spaces and a star.
Complessità attesa
O(n^2) time, O(n^2) extra space
Riferimenti
Questa sfida è adattata per CodeUtility. Segui la traccia e i vincoli sopra.