我需要制作一个程序来定义这个词是否是字谜。嗯,这是我的代码。标有 的线条## here反映了主要问题。我需要定义的索引word1和word2第一和第二的for循环,然后对它们进行比较。如果这些索引相似,那么程序就会错过这个词(因为它在迭代时出现了两次)。我知道,代码还没有完成text_sample = 'text goes here'c = 0i = 0isanagramma = 0n = len(text_sample)while c < len(text_sample): for word1 in text_sample: for word2 in range(1,n): s1 = sorted(word1) s2 = sorted(text_sample[word2]) index1 = text_sample.index(word1) ## here index2 = text_sample.index(text_sample[word2]) ## here if index1 == index2: ## here continue ## here if s1 == s2: isanagrama+=1 i+=1 c+=1print(isanagramma)
1 回答
沧海一幻觉
TA贡献1824条经验 获得超5个赞
text_sample = 'text goes here ttex'
s = text_sample.split(" ")
isanagramma = 0
for i in range (0,len(s)-1):
for x in range(i+1,len(s)):
if sorted(s[i]) == sorted(s[x]):
print ("is anagram :{} and {}".format(s[i],s[x]))
isanagramma += isanagramma
else:
print ("not anagram :{} and {}".format(s[i],s[x]))
print (isanagramma)
输出:
not anagram :text and goes
not anagram :text and here
is anagram :text and ttex
not anagram :goes and here
not anagram :goes and ttex
not anagram :here and ttex
1
添加回答
举报
0/150
提交
取消