我需要制作一個程序來定義這個詞是否是字謎。嗯，這是我的代碼。標(biāo)有 的線條## here反映了主要問題。我需要定義的索引word1和word2第一和第二的for循環(huán)，然后對它們進(jìn)行比較。如果這些索引相似，那么程序就會錯過這個詞（因?yàn)樗诘鷷r出現(xiàn)了兩次）。我知道，代碼還沒有完成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貢獻(xiàn)1824條經(jīng)驗(yàn) 獲得超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
提交
取消