展开全部
def getsubset(myset,subtract):
if len(myset)<&#61;1:
return []
result&#61;[]
newsubtract&#61;subtract.copy()
for i in subtract:
result.append(myset-{i})
newsubtract&#61;newsubtract-{i}
result.extend(getsubset(myset-{i},newsubtract))
return result
def subset(myset):
result&#61;[set(),myset] if myset else [myset]
result.extend(getsubset(myset,myset))
return result
result&#61;subset({&#39;a&#39;,&#39;b&#39;,&#39;c&#39;,&#39;d&#39;})
toprint&#61;[sorted(x) for x in result]
for i in sorted(toprint,key&#61;lambda x:(len(x),x)):
print(i)
虽然这对我来说的确比较简单&#xff0c;可也不是几32313133353236313431303231363533e4b893e5b19e31333335313230分钟就能写出来的&#xff0c;好歹给点分吧
而且(a,b,a,c) 不是集合&#xff0c;集合中元素不应有重复
一个n个元素的集合的所有子集是2的n次方个吗&#xff0c;如是&#xff0c;这个程序应该就是正确的