Problema
This diamond has 2n − 1 rows. Number the rows k = 1 to 2n − 1 and let m = n − |n − k|, so m goes 1, 2, …, n, …, 2, 1. Row k has n − m leading spaces, then the digits 1, 2, …, m, then m − 1, …, 1, written next to each other with no spaces. The middle row is the longest, for example 12321 when n = 3.
Implement number_diamond(n).
Input
n: The number of rows in the top half, including the middle row (at most 9, so every number is one digit).
Output
Return the 2n − 1 rows from top to bottom, without trailing spaces. When n is 0, return an empty list.
Vincoli
0 ≤ n ≤ 9
Esempi
Input:
n = 3
Output atteso:
expected = [" 1", " 121", "12321", " 121", " 1"]
Input:
long long n = 3;
Output atteso:
std::vector<std::string> expected = {" 1", " 121", "12321", " 121", " 1"};
Input:
long n = 3;
Output atteso:
string[] expected = new string[] {" 1", " 121", "12321", " 121", " 1"};
Spiegazione
m goes 1, 2, 3, 2, 1: [" 1", " 121", "12321", " 121", " 1"].
Input:
n = 2
Output atteso:
expected = [" 1", "121", " 1"]
Input:
long long n = 2;
Output atteso:
std::vector<std::string> expected = {" 1", "121", " 1"};
Input:
long n = 2;
Output atteso:
string[] expected = new string[] {" 1", "121", " 1"};
Spiegazione
Three rows with m = 1, 2, 1: [" 1", "121", " 1"].
Come affrontarlo
Prova prima da solo, poi apri un suggerimento alla volta.
Suggerimento 1
First work out the peak value m of each row: 1, 2, ..., n, ..., 2, 1.
Suggerimento 2
A row with peak m counts from 1 up to m and back to 1.
Suggerimento 3
The leading spaces depend only on m.
Complessità attesa
O(n^2) time, O(n^2) extra space
Riferimenti
Questa sfida è adattata per CodeUtility. Segui la traccia e i vincoli sopra.