Problème
Each row of this pyramid reads the same forwards and backwards. Row i (counting from 1) has n − i leading spaces, then the digits 1, 2, …, i, then i − 1, …, 2, 1, all written next to each other with no spaces in between. So row 3 is 12321 and row 1 is 1.
Implement palindromic_number_pyramid(n).
Input
n: The number of rows (at most 9, so every number is a single digit).
Output
Return the rows from top to bottom, without trailing spaces.
Contraintes
0 ≤ n ≤ 9
Exemples
Entrée :
n = 3
Sortie attendue :
expected = [" 1", " 121", "12321"]
Entrée :
long long n = 3;
Sortie attendue :
std::vector<std::string> expected = {" 1", " 121", "12321"};
Entrée :
long n = 3;
Sortie attendue :
string[] expected = new string[] {" 1", " 121", "12321"};
Explication
Row 1 is 2 spaces and 1, row 2 is 1 space and 121, row 3 is 12321: [" 1", " 121", "12321"].
Entrée :
n = 1
Sortie attendue :
expected = ["1"]
Entrée :
long long n = 1;
Sortie attendue :
std::vector<std::string> expected = {"1"};
Entrée :
long n = 1;
Sortie attendue :
string[] expected = new string[] {"1"};
Explication
One row with the digit 1: ["1"].
Comment l'aborder
Essayez d'abord seul, puis ouvrez les indices un par un.
Indice 1
Split each row into an up part 1..i and a down part i − 1..1.
Indice 2
The down part is the up part reversed without its last digit.
Indice 3
Leading spaces follow the same rule as in the star pyramid.
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.