2
我想字符串的所有组合的话“我的第一个节目”得到所有组合的字符串的话
我想字符串的所有组合的话“我的第一个节目”得到所有组合的字符串的话
>>> lst = "my first program".split()
>>> set(itertools.permutations(lst))
set([('first', 'my', 'program'),
('first', 'program', 'my'),
('my', 'first', 'program'),
('my', 'program', 'first'),
('program', 'first', 'my'),
('program', 'my', 'first')])
如果你想在Python本身做到这一点...
def recurse_combinations(used, unused, dic):
if len(unused) == 0:#If unused is empty we are done
dic[used]= True #Lets store the result and stop recursing
return
for i in range(len(unused)):
#keep recursing by going through 'unused' characters and adding them to 'used'. Now lets take out the single character we are now using from 'unused'
recurse_combinations(used + unused[i], unused[:i]+unused[i+1:], dic )
def recurse_combinations_start(word="my first program"):
dic = {}
recurse_combinations("" , word, dic)
pprint (dic.keys())
print len(dic.keys())
简单调用recurse_combinations_start()并更改要使用的单词
您是否在问每一个可以拼写这些单词的单词?或者你可以通过任何方式订购这三个词? – 2010-08-16 22:48:07