Python：一步一步切片和删除

Question

I have a recursive Python function that removes one item from a copy of a list before passing the smaller list to the recursion:

B = A[:]
B.remove(C)
Recursion(B)

That works fine, but it seems more elegant to do:

Recursion(A[:].remove(C))

Unfortunately A[:].remove(C) yeilds None . (Why?) Is there an elegant way to do this in one line?

Answer 1

好吧，您可以使用列表推导完成以下操作，该推导创建一个没有C元素的新列表，即假设A只有一个C元素-因为remove()消除了该元素的第一次出现，而列表推导则去除了所有事件：

Recursion([x for x in A if x != C])