Mittel 0 gelöst 0% Erfolgsquote

Decode the Pattern

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

Das lernst du

  • 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

Problem

Übersetzung anzeigen

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.

Einschränkungen

0 ≤ n ≤ 26

Beispiele

Beispiel 1
Eingabe:
n = 2

Erwartete Ausgabe:
expected = ["BBB", "BAB", "BBB"]
Eingabe:
long long n = 2;

Erwartete Ausgabe:
std::vector<std::string> expected = {"BBB", "BAB", "BBB"};
Eingabe:
long n = 2;

Erwartete Ausgabe:
string[] expected = new string[] {"BBB", "BAB", "BBB"};

Erläuterung

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

Beispiel 2
Eingabe:
n = 4

Erwartete Ausgabe:
expected = ["DDDDDDD", "DCCCCCD", "DCBBBCD", "DCBABCD", "DCBBBCD", "DCCCCCD", "DDDDDDD"]
Eingabe:
long long n = 4;

Erwartete Ausgabe:
std::vector<std::string> expected = {"DDDDDDD", "DCCCCCD", "DCBBBCD", "DCBABCD", "DCBBBCD", "DCCCCCD", "DDDDDDD"};
Eingabe:
long n = 4;

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

Erläuterung

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

So gehst du vor

Versuch es zuerst allein und öffne dann einen Hinweis nach dem anderen.

Hinweis 1

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

Hinweis 2

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

Hinweis 3

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

Erwartete Komplexität

O(n^2) time, O(n^2) extra space

Referenzen

Diese Aufgabe wurde für CodeUtility angepasst. Beachte die oben genannten Vorgaben und Einschränkungen.

Die beste bestandene Lösung jedes Coders. Schnellere, sparsamere und besser bewertete Lösungen stehen weiter oben.

Noch keine bestandene Lösung. Löse sie und hol dir Platz eins.

Von anderen lernen

Community-Lösungen

Noch keine veröffentlichten Lösungen. Löse die Aufgabe und teile als Erster eine Lösung.