我如何获得这样的嵌套列表？

Question

variable tree structure

- nestedList1 variable

aa3
 |
aa1      aa2      bb1
   \    /        /
     aa       bb
       \     /
         root

- nestedList2 variable

              bb4
               |
aa3           bb2     bb3
 |              \     /
aa1      aa2      bb1    cc1
   \    /        /        |
     aa       bb         cc
       \       |        /
              root

nestedList1 = ['root', ['aa', ['aa1', ['aa3'], 'aa2'], 'bb', ['bb1']]]
nestedList2 = ['root', ['aa', ['aa1', ['aa3'], 'aa2'], 'bb', ['bb1', ['bb2', ['bb4'], 'bb3']], 'cc', ['cc1']]]

def ConvertTraverse(nlist, depth=0):
    convertlist = []
    for leaf in nlist:
        if isinstance(leaf, list):
            tmplist = ConvertTraverse(leaf, depth+1)
            convertlist.insert(0, tmplist)
        else:
            convertlist += [leaf]
    return convertlist

print ConvertTraverse(nestedList1)
print ConvertTraverse(nestedList2)

• 结果
  nestedList1:[[['bb1'], [['aa3'], 'aa1', 'aa2'], 'aa', 'bb'], 'root']
  nestedList2:[[['cc1'], [[['bb4'], 'bb2', 'bb3'], 'bb1'], [['aa3'], 'aa1', 'aa2'], 'aa', 'bb', 'cc'], 'root']

我想要的只是下面的结果.

• 结果
  nestedList1:[[[['aa3'], 'aa1', 'aa2'], 'aa', ['bb1'], 'bb'], 'root']
  nestedList2:[[[['aa3'], 'aa1', 'aa2'], 'aa', [[['bb4'], 'bb2', 'bb3'], 'bb1'], 'bb', ['cc1'], 'cc'], 'root']

我如何获得这样的嵌套列表？我想要一个嵌套列表,命令下载后遍历.

Answer 1

基本上，为了对列表进行重新排序，您需要执行以下操作：每当第n一个元素是标签，并且n+1第一个元素是子列表时，交换两者。您可以在几行中就地完成此操作：

def reorder(lst):
    for i, (cur, nxt) in enumerate(zip(lst, lst[1:])):
        if isinstance(cur, str) and isinstance(nxt, list):
            reorder(nxt)
            lst[i:i+2] = [nxt, cur]

对于非就地解决方案，您只需创建列表的深层副本，然后在副本上使用它。