pythonic迭代set / remnant集的方法

Question

做以下事情的干净方法是什么：

def foo(aSet) :
    for a in aSet:
        for remaining in aSet - {a} :
            doSomething(a,remaining)

我认为必须有一些写作方式只是一个循环？

Answer 1

aSet = {1,2,3}
[[i,j] for i in aSet for j in aSet if j != i]
#=> [[1, 2], [1, 3], [2, 1], [2, 3], [3, 1], [3, 2]]

在你的情况下，你需要一个发电机

(doSomething(i, j) for i in aSet for j in aSet if j != i)

Answer 2

>>> from itertools import permutations
>>> aSet = {1, 2, 3}
>>> list(permutations(aSet, 2))
[(1, 2), (1, 3), (2, 1), (2, 3), (3, 1), (3, 2)]

>>> for a, remaining in permutations(aSet, 2):
...     print(a, remaining, end=', ')
... 
1 2, 1 3, 2 1, 2 3, 3 1, 3 2,