Todos los desafíos
Intermedio 0 resueltos 0% de aceptación

Decode the Pattern

Work out the rule behind a family of letter squares from its first members, then build the member for any n.

Lo que aprenderás

  • Describe a picture with a rule in the row and column numbers
  • Measure a ring number as a maximum of two distances
  • Map a number to a letter

Problema

Ver traducción

A puzzle book shows the first three members of a pattern family and asks for the rest:

n = 1    n = 2    n = 3

A        BBB      CCCCC
         BAB      CBBBC
         BBB      CBABC
                  CBBBC
                  CCCCC

Study them before reading on and try to name the rule. Here it is, stated exactly: member n is a square of 2n − 1 rows, each 2n − 1 letters long with no spaces. Number rows and columns from 0 and let the centre be position n − 1. The cell in row r and column c shows the letter that comes d places after A in the alphabet, where d = max(|r − (n − 1)|, |c − (n − 1)|) is how many rings the cell lies away from the centre. So the centre is A, the ring around it is B, and the outer edge is the n-th letter.

Implement decode_the_pattern(n).

Input

n: Which member of the family to build (at most 26, so the letters never run past Z).

Output

Return the 2n − 1 rows from top to bottom. When n is 0, return an empty list.

Restricciones

0 ≤ n ≤ 26

Ejemplos

Ejemplo 1
Entrada:
n = 2

Salida esperada:
expected = ["BBB", "BAB", "BBB"]
Entrada:
long long n = 2;

Salida esperada:
std::vector<std::string> expected = {"BBB", "BAB", "BBB"};
Entrada:
long n = 2;

Salida esperada:
string[] expected = new string[] {"BBB", "BAB", "BBB"};

Explicación

Only the centre (1, 1) is 0 rings away, every other cell is 1 ring away: ["BBB", "BAB", "BBB"].

Ejemplo 2
Entrada:
n = 4

Salida esperada:
expected = ["DDDDDDD", "DCCCCCD", "DCBBBCD", "DCBABCD", "DCBBBCD", "DCCCCCD", "DDDDDDD"]
Entrada:
long long n = 4;

Salida esperada:
std::vector<std::string> expected = {"DDDDDDD", "DCCCCCD", "DCBBBCD", "DCBABCD", "DCBBBCD", "DCCCCCD", "DDDDDDD"};
Entrada:
long n = 4;

Salida esperada:
string[] expected = new string[] {"DDDDDDD", "DCCCCCD", "DCBBBCD", "DCBABCD", "DCBBBCD", "DCCCCCD", "DDDDDDD"};

Explicación

The edge cells are 3 rings out (D); row 3 is the middle row: ["DDDDDDD", "DCCCCCD", "DCBBBCD", "DCBABCD", "DCBBBCD", "DCCCCCD", "DDDDDDD"].

Cómo abordarlo

Inténtalo primero por tu cuenta y luego abre las pistas una a una.

Pista 1

Mark the centre of each sample square and see how the letters change as you move away from it.

Pista 2

Cells on the same ring share a letter; the ring number uses the larger of the row and column distances to the centre.

Pista 3

Check your rule on the n = 3 sample before building any n.

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.

Clasificación

Clasificación completa

La mejor solución aprobada de cada programador. Las más rápidas, ligeras y mejor valoradas van primero.

Aún no hay soluciones aprobadas. Resuélvelo y quédate el primer puesto.

Aprende de otros

Soluciones de la comunidad

Aún no hay soluciones publicadas. Resuelve este reto para compartir la primera.