# LeetCode刷题（756）--- Pyramid Transition Matrix 金字塔转变矩阵

We are stacking blocks to form a pyramid. Each block has a color which is a one letter string, like 'Z'.我们用一些方块来堆砌一个金字塔，每个方块是仅包含一个字母的字符串，比如"Z"。

For every block of color C we place not in the bottom row, we are placing it on top of a left block of color A and right block of color B. We are allowed to place the block there only if (A, B, C) is an allowed triple（三元组）. (A,B,C)表示C为顶层方块，A和B分别为左、右子块，当且仅当(A,B,C)是被允许的三元组，我们才可以将其堆砌上。

We start with a bottom row of bottom, represented as a single string. We also start with a list of allowed triples allowed. Each allowed triple is represented as a string of length 3. 初始时，给定金字塔的基层 bottom，用一个字符串表示。一个允许的三元组列表 allowed，每个三元组用一个长度为 3 的字符串表示。

Return true if we can build the pyramid all the way to the top, otherwise false. 如果可以由基层一直堆到塔尖返回true，否则返回false。

Example 1:

Input: bottom = "XYZ", allowed = ["XYD", "YZE", "DEA", "FFF"]
Output: true
Explanation:
We can stack the pyramid like this:
A
/ \
D   E
/ \ / \
X   Y   Z

This works because ('X', 'Y', 'D'), ('Y', 'Z', 'E'), and ('D', 'E', 'A') are allowed triples.


Example 2:

Input: bottom = "XXYX", allowed = ["XXX", "XXY", "XYX", "XYY", "YXZ"]
Output: false
Explanation:
We can't stack the pyramid to the top.
Note that there could be allowed triples (A, B, C) and (A, B, D) with C != D.


Note:

1. bottom will be a string with length in range [2, 8].
2. allowed will have length in range [0, 200].
3. Letters in all strings will be chosen from the set {'A', 'B', 'C', 'D', 'E', 'F', 'G'}.

• 写评论