擅长:python、mysql、java
<p>你的例子已经差不多了,只需要稍微调整一下</p>
<pre><code>s = 'azcbobobegghakl'
longest = [s[0],] # make them lists so we can manipulate them (unlike strings)
current = [s[0],]
for letter in range(0, len(s) -1):
if s[letter + 1] >= s[letter]:
current.append(s[letter + 1])
if len(current) > len(longest):
longest = current
else:
current = [s[letter+1],] # reset current if we break an alphabetical chain
longest_string = ''.join(longest) # turn out list back into a string
</code></pre>
<p><code>longest_string</code>的输出:</p>
^{pr2}$