<p>假设地图的布局比2x2块更复杂:</p>
<pre><code>from itertools import chain
from pprint import pprint
a = [["a","a","a"],
["a","a","a"],
["a","a","a"]]
b = [["b","b","b"],
["b","b","b"],
["b","b","b"]]
c = [["c","c","c"],
["c","c","c"],
["c","c","c"]]
d = [["d","d","d"],
["d","d","d"],
["d","d","d"]]
e = [["e","e","e"],
["e","e","e"],
["e","e","e"]]
f = [["f","f","f"],
["f","f","f"],
["f","f","f"]]
layouts = [
((a, b), (c, d)),
((a, b, c), (d, e, f)),
((a, b), (c, d), (e, f)),
]
for layout in layouts:
total = [list(chain(*row)) for lrow in layout for row in zip(*lrow)]
pprint(total)
</code></pre>
<p><strong>输出:</strong></p>
<pre><code>[['a', 'a', 'a', 'b', 'b', 'b'],
['a', 'a', 'a', 'b', 'b', 'b'],
['a', 'a', 'a', 'b', 'b', 'b'],
['c', 'c', 'c', 'd', 'd', 'd'],
['c', 'c', 'c', 'd', 'd', 'd'],
['c', 'c', 'c', 'd', 'd', 'd']]
[['a', 'a', 'a', 'b', 'b', 'b', 'c', 'c', 'c'],
['a', 'a', 'a', 'b', 'b', 'b', 'c', 'c', 'c'],
['a', 'a', 'a', 'b', 'b', 'b', 'c', 'c', 'c'],
['d', 'd', 'd', 'e', 'e', 'e', 'f', 'f', 'f'],
['d', 'd', 'd', 'e', 'e', 'e', 'f', 'f', 'f'],
['d', 'd', 'd', 'e', 'e', 'e', 'f', 'f', 'f']]
[['a', 'a', 'a', 'b', 'b', 'b'],
['a', 'a', 'a', 'b', 'b', 'b'],
['a', 'a', 'a', 'b', 'b', 'b'],
['c', 'c', 'c', 'd', 'd', 'd'],
['c', 'c', 'c', 'd', 'd', 'd'],
['c', 'c', 'c', 'd', 'd', 'd'],
['e', 'e', 'e', 'f', 'f', 'f'],
['e', 'e', 'e', 'f', 'f', 'f'],
['e', 'e', 'e', 'f', 'f', 'f']]
</code></pre>