Problem
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.
Einschränkungen
0 ≤ n ≤ 100
Beispiele
Eingabe:
n = 4
Erwartete Ausgabe:
expected = [" *", " * *", " * *", "*******"]
Eingabe:
long long n = 4;
Erwartete Ausgabe:
std::vector<std::string> expected = {" *", " * *", " * *", "*******"};
Eingabe:
long n = 4;
Erwartete Ausgabe:
string[] expected = new string[] {" *", " * *", " * *", "*******"};
Erläuterung
Rows 2 and 3 keep only their ends, row 4 is the solid base of 7 stars: [" *", " * *", " * *", "*******"].
Eingabe:
n = 2
Erwartete Ausgabe:
expected = [" *", "***"]
Eingabe:
long long n = 2;
Erwartete Ausgabe:
std::vector<std::string> expected = {" *", "***"};
Eingabe:
long n = 2;
Erwartete Ausgabe:
string[] expected = new string[] {" *", "***"};
Erläuterung
Row 2 is the base, so it is solid: [" *", "***"].
So gehst du vor
Versuch es zuerst allein und öffne dann einen Hinweis nach dem anderen.
Hinweis 1
Leading spaces are the same as in the solid pyramid.
Hinweis 2
The tip has width 1 and the base is the last row; both are solid.
Hinweis 3
Any other row is a star, some spaces and a star.
Erwartete Komplexität
O(n^2) time, O(n^2) extra space
Referenzen
Diese Aufgabe wurde für CodeUtility angepasst. Beachte die oben genannten Vorgaben und Einschränkungen.