<p>我有一个字典列表,它们本身有嵌套的字典列表。谢天谢地,所有的巢层都有相似的结构。我想对这些嵌套的词典列表进行排序。我掌握了按值对词典列表排序的技巧。我正在努力使用递归来对内部列表进行排序。你知道吗</p>
<pre><code>def reorder(l, sort_by):
# I have been trying to add a recursion here
# so that the function calls itself for each
# nested group of "children". So far, fail
return sorted(l, key=lambda k: k[sort_by])
l = [
{ 'name': 'steve',
'children': [
{ 'name': 'sam',
'children': [
{'name': 'sally'},
{'name': 'sabrina'}
]
},
{'name': 'sydney'},
{'name': 'sal'}
]
},
{ 'name': 'fred',
'children': [
{'name': 'fritz'},
{'name': 'frank'}
]
}
]
print(reorder(l, 'name'))
</code></pre>
<pre><code>def reorder(l, sort_by):
l = sorted(l, key=lambda x: x[sort_by])
for item in l:
if "children" in item:
item["children"] = reorder(item["children"], sort_by)
return l
</code></pre>