Problema
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.
Restricciones
0 ≤ n ≤ 9
Ejemplos
Entrada:
n = 3
Salida esperada:
expected = [" 1", " 121", "12321"]
Entrada:
long long n = 3;
Salida esperada:
std::vector<std::string> expected = {" 1", " 121", "12321"};
Entrada:
long n = 3;
Salida esperada:
string[] expected = new string[] {" 1", " 121", "12321"};
Explicación
Row 1 is 2 spaces and 1, row 2 is 1 space and 121, row 3 is 12321: [" 1", " 121", "12321"].
Entrada:
n = 1
Salida esperada:
expected = ["1"]
Entrada:
long long n = 1;
Salida esperada:
std::vector<std::string> expected = {"1"};
Entrada:
long n = 1;
Salida esperada:
string[] expected = new string[] {"1"};
Explicación
One row with the digit 1: ["1"].
Cómo abordarlo
Inténtalo primero por tu cuenta y luego abre las pistas una a una.
Pista 1
Split each row into an up part 1..i and a down part i − 1..1.
Pista 2
The down part is the up part reversed without its last digit.
Pista 3
Leading spaces follow the same rule as in the star pyramid.
Complejidad esperada
O(n^2) time, O(n^2) extra space
Referencias
Este reto está adaptado para CodeUtility. Sigue el enunciado y las restricciones indicadas arriba.