def is_list(p):
return isinstance(p, list)
def deep_reverse(list):
o=[]
for i in reversed(list):
if is_list(i)==True:
print i
deep_reverse(i)
o.append(i)
return o
Run Code Online (Sandbox Code Playgroud)
例如:
p = [1, [2, 3, [4, [5, 6]]]]
print deep_reverse(p)
#>>> [[[[6, 5], 4], 3, 2], 1]
Run Code Online (Sandbox Code Playgroud)
改变线
deep_reverse(i)
Run Code Online (Sandbox Code Playgroud)
至
i = deep_reverse(i)
Run Code Online (Sandbox Code Playgroud)
顺便说一下,编写此函数的更简单方法是:
def deep_reverse(lst):
if not is_list(lst):
return lst
return map(deep_reverse, reversed(lst))
Run Code Online (Sandbox Code Playgroud)
| 归档时间: |
|
| 查看次数: |
407 次 |
| 最近记录: |