समस्या
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
CCCCCStudy 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.
सीमाएँ
0 ≤ n ≤ 26
उदाहरण
इनपुट:
n = 2
अपेक्षित आउटपुट:
expected = ["BBB", "BAB", "BBB"]
इनपुट:
long long n = 2;
अपेक्षित आउटपुट:
std::vector<std::string> expected = {"BBB", "BAB", "BBB"};
इनपुट:
long n = 2;
अपेक्षित आउटपुट:
string[] expected = new string[] {"BBB", "BAB", "BBB"};
व्याख्या
Only the centre (1, 1) is 0 rings away, every other cell is 1 ring away: ["BBB", "BAB", "BBB"].
इनपुट:
n = 4
अपेक्षित आउटपुट:
expected = ["DDDDDDD", "DCCCCCD", "DCBBBCD", "DCBABCD", "DCBBBCD", "DCCCCCD", "DDDDDDD"]
इनपुट:
long long n = 4;
अपेक्षित आउटपुट:
std::vector<std::string> expected = {"DDDDDDD", "DCCCCCD", "DCBBBCD", "DCBABCD", "DCBBBCD", "DCCCCCD", "DDDDDDD"};
इनपुट:
long n = 4;
अपेक्षित आउटपुट:
string[] expected = new string[] {"DDDDDDD", "DCCCCCD", "DCBBBCD", "DCBABCD", "DCBBBCD", "DCCCCCD", "DDDDDDD"};
व्याख्या
The edge cells are 3 rings out (D); row 3 is the middle row: ["DDDDDDD", "DCCCCCD", "DCBBBCD", "DCBABCD", "DCBBBCD", "DCCCCCD", "DDDDDDD"].
कैसे हल करें
पहले खुद कोशिश करें, फिर एक-एक करके संकेत खोलें।
संकेत 1
Mark the centre of each sample square and see how the letters change as you move away from it.
संकेत 2
Cells on the same ring share a letter; the ring number uses the larger of the row and column distances to the centre.
संकेत 3
Check your rule on the n = 3 sample before building any n.
अपेक्षित जटिलता
O(n^2) time, O(n^2) extra space
संदर्भ
यह चुनौती CodeUtility के लिए अनुकूलित की गई है। ऊपर दिए गए स्टेटमेंट और सीमाओं का पालन करें।