任意长度的python列表_在Python中压扁任意嵌套列表的最快方法是什么？

这个函数应该能够在不使用任何recursion的情况下快速地压扁嵌套的可迭代容器：

import collections def flatten(iterable): iterator = iter(iterable) array, stack = collections.deque(), collections.deque() while True: try: value = next(iterator) except StopIteration: if not stack: return tuple(array) iterator = stack.pop() else: if not isinstance(value, str) \ and isinstance(value, collections.Iterable): stack.append(iterator) iterator = iter(value) else: array.append(value)

大约五年后，我对这个问题的看法已经改变了，这可能会更好用：

def main(): data = [1, 2, [3, 4, [5], []], [6]] print(list(flatten(data))) def flatten(iterable): iterator, sentinel, stack = iter(iterable), object(), [] while True: value = next(iterator, sentinel) if value is sentinel: if not stack: break iterator = stack.pop() elif isinstance(value, str): yield value else: try: new_iterator = iter(value) except TypeError: yield value else: stack.append(iterator) iterator = new_iterator if __name__ == '__main__': main()