擅长:python、mysql、java
<p>对于您的示例数组来说,这并不能提高性能。但是,如果传入的列表具有任意维N*M,那么可以创建一个通用递归函数</p>
<p>代码示例:</p>
<pre><code>bbb = [[[1, 2, 3], [4, 5, 6]], [[7, 8, 9], [10, 11, 12]]]
def generic_recursive(thelist, res):
"""
Generic Recursive Function
Converting Array of Dim = n arrays to dim 2
"""
if not thelist:
return res
else:
if isinstance(thelist[0], int):
res.append(thelist)
return generic_recursive([], res)
else:
res.extend( generic_recursive(thelist[0], []))
return generic_recursive(thelist[1:], res)
bbb2 = generic_recursive(bbb,[])
print(bbb)
print(bbb2)
print(len(bbb))
print(len(bbb2))
</code></pre>