x='asasdaessaasccvasadcda'
l=[y?for?y?in?x]
for?i?in?range(len(l)):
????if?l[i]>l[i+1]:
????????l.insert(i+1,'?')#我應(yīng)該是超出邊界了?。?！
content?=?''.join(l)
l2=content.split()
print?l2
l3=[]
for?n?in?l2:
????a=len(n)
????l3.append(a)
print?'Longest?substring?in?alphabetical?order?is:%s'%(l2[l3.index(max(l3))])這是個(gè)求按照英文字母順序排序，連續(xù)最長(zhǎng)的找出來(lái)，上面是我寫(xiě)的，很屎。。。。。。就想問(wèn)大大們，問(wèn)題怎么修改？我應(yīng)該是超出邊界了?。?！
1 回答
孤獨(dú)的小豬
TA貢獻(xiàn)232條經(jīng)驗(yàn) 獲得超302個(gè)贊
你的代碼算出來(lái)的結(jié)果好像是錯(cuò)誤的，可以按照下面代碼算出正確結(jié)果：
s?=?"asasdaessaasccvasadcda"
ls?=?""
for?i?in?range(0,?len(s)-1):
????b?=?""
????ss?=?""
????j?=?2
????while?j?<?len(s):
????????ss?=?s[i:i+j]
????????b?=?sorted(ss)
????????str1?=?''.join(b)
????????j?+=?1
????????if?str1?==?ss:
????????????ks?=?ss
????????else:
????????????break
????if?len(ks)?>?len(ls):
????????ls?=?ks
print("The?Longest?substring?in?alphabetical?order?is?"+ls)添加回答
舉報(bào)
0/150
提交
取消