Tous les défis
Moyen 0 résolus 0 % de réussite

Decode the Pattern

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

Ce que vous allez apprendre

  • 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

Problème

Afficher la traduction

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.

Contraintes

0 ≤ n ≤ 26

Exemples

Exemple 1
Entrée :
n = 2

Sortie attendue :
expected = ["BBB", "BAB", "BBB"]
Entrée :
long long n = 2;

Sortie attendue :
std::vector<std::string> expected = {"BBB", "BAB", "BBB"};
Entrée :
long n = 2;

Sortie attendue :
string[] expected = new string[] {"BBB", "BAB", "BBB"};

Explication

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

Exemple 2
Entrée :
n = 4

Sortie attendue :
expected = ["DDDDDDD", "DCCCCCD", "DCBBBCD", "DCBABCD", "DCBBBCD", "DCCCCCD", "DDDDDDD"]
Entrée :
long long n = 4;

Sortie attendue :
std::vector<std::string> expected = {"DDDDDDD", "DCCCCCD", "DCBBBCD", "DCBABCD", "DCBBBCD", "DCCCCCD", "DDDDDDD"};
Entrée :
long n = 4;

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

Explication

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

Comment l'aborder

Essayez d'abord seul, puis ouvrez les indices un par un.

Indice 1

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

Indice 2

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

Indice 3

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

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.

La meilleure solution validée de chaque codeur. Les plus rapides, les plus légères et les mieux notées passent devant.

Aucune solution validée pour l'instant. Résolvez-le et prenez la première place.

Apprenez des autres

Solutions de la communauté

Aucune solution publiée pour l'instant. Résolvez ce défi pour partager la première.