How to deal with deep nested Python list

「已注销」

于 2017-08-16 21:19:21 发布

阅读量422

点赞数 1

CC 4.0 BY-SA版权

分类专栏： python 文章标签： python pythonlist

本文链接：https://blog.youkuaiyun.com/Lockey23/article/details/77278427

python 专栏收录该内容

158 篇文章

订阅专栏

本文介绍如何处理Python中常见的嵌套列表问题，对于较浅的嵌套列表，可以通过结合if语句与isinstance()内置函数来解决；对于深层嵌套列表，则推荐使用递归函数的方法进行遍历。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

As the most common and basic data struct in Python , List is used in many situations , but when we meet deep nested List ,how we deal with it?

For fewer nested python list we can combine if clause and isinstance()BIF to handle it as follow eg(two level nested list):

lst=["level1.2",["level2.1","level2.2"],"level1.3"]
for item in lst:
  if isinstance(item, list):
    for item1 in item:
    print (item1)
  else:
    print (item)

这里写图片描述
2.For deeply nested list , absolutely you can add more if clause and isinstance()BIF to handle, but there is a problem: many levels if judgements and too much code makes it hard to understand the program, so we try another way: define a function then do a selfcall(recursion) to access the list

flag = 0
lst=["level1.2",["level2.1",["level2.21",["level2.211",["level2.211",["level2.211",["level2.211","level2.212"]]]]]],"level1.3"]
def deep_list(lst):
        global flag
        for item in lst:
            if isinstance(item, list):
                flag=flag+1
                print ("list level:",flag,"start")
                deep_list(item)
            else:
                print (item)

deep_list(lst)

这里写图片描述