python嵌套循环递归怎么相加_Python数组的嵌套深度递归解,python,求解

A list that contains lists is sometimes called nested. We define the nesting depth of a list as follows:

A list that does not contain any list has a nesting depth of zero

A list that contains lists has a nesting depth equal to the maximum nesting depth of the lists it contains, plus one.

Note that "a list that contains lists" can also contain values that are not lists.

For example, the nesting depth of

[[1,2], [2,4]]

is 1, while the nesting depth of

[1, [2], [[3], [[4], 5]]]

is 3.

Write a function that takes as argument a list and returns its nesting depth.

What does your function return when called with the list

[[[]]]

? (and is that what it should return?)

期望输出结果:

1

3

2

0

测试用例

print(nesting_depth([1,2],[2,4]))

print(nesting_depth(1,[2],[[3],[[4],5]]]))

print(nesting_depth([[[]]]))

print(nesting_depth([]))

解决方案：

def nesting_depth(a_list):

flag=False

num = []

for i in a_list:

if isinstance(i,list):

flag=True

num.append(nesting_depth(i))

if flag:

return max(num)+1

else:

return 0

求数组嵌套的深度，使用递归求解，重点在于对嵌套数组最多的数组求其递归的次数，即为嵌套的深度。

为求嵌套的次数，定义一个boolean变量 用于判断通过循环取出的值是否为数组，定义一个空数组 用于存放循环取出的值中嵌套的次数