新手求教

lddllh1223

Write recursive function nestingDepth(inList) that returns a number representing the "nesting depth" of the input list where nesting depth is 1) 0 if the list contains no lists as elements, 2) one greater than the maximum of the nesting depths of all of the items that are lists.

19304270021304

1. def nestingDepth(inList):
   
2.     list1 = list(filter(lambda x : isinstance(x,list), inList))
   
3.     if list1:
   
4.             return max(map(nestingDepth, list1)) + 1
   
5.     else:
   
6.             return 0

复制代码

老兄，以后请讲中文…………