Python遍历嵌套列表

nested_list = [1, [2, 3], [4, [5, 6], 7]]

def traverse_nested_list(nested_list):
    for item in nested:
        if isinstance(item, list):
            traverse_nested_list(item)
        else:
            print(item)

nested_list = [1, [2, 3], [4, [5, 6], 7]]
traverse_nested_list(nested_list)

# 计算嵌套列表中所有元素的总和
def sum_nested_list(nested_list):
    total = 0
    for item in nested_list:
        if isinstance(item, list):
            total += sum_nested_list(item)
        else:
            total += item
    return total

nested_list = [1, [2, 3], [4, [5, 6], 7]]
print(sum_nested_list(nested_list))  # 输出: 28

def traverse_nested_list(nested_list):
    for item in nested_list:
        if isinstance(item, list):
            traverse_nested_list(item)
        else:
            print(item)

import sys
sys.setrecursionlimit(10000)  # 增加递归深度限制