python 数组的嵌套深度 递归求解

本文介绍如何计算Python列表的嵌套深度。定义一个列表的嵌套深度为:不含列表的列表深度为0,含列表的列表深度为其包含的列表最大深度加1。并提供了一个递归函数来解决此问题,给出了不同测试用例的结果。

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([[[]]]))

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值