擅长:python、mysql、java
<p>指数是你的朋友。
下面是问题的简单代码。在</p>
<pre><code>longword = ''
for x in range(len(s)-1):
for y in range(len(s)+1):
word = s[x:y]
if word == ''.join(sorted(word)):
if len(word) > len(longword):
longword = word
print ('Longest substring in alphabetical order is: '+ longword)
</code></pre>