Given an integer n, return a diamond shape made of stars: a pyramid of height n stacked on top of an inverted pyramid of height n - 1. The total output has 2n - 1 rows, joined by \n.
1 ≤ n ≤ 20Build the top half exactly like the pyramid problem.
3