擅长:python、mysql、java
<p>根本不需要递归。在</p>
<pre><code>def findmax(s):
matches = []
current = [s[0]]
for index, character in enumerate(s[1:]):
if character >= s[index]:
current.append(character)
else:
matches.append(current)
current = [character]
matches.append(current)
maxlen = len(max(matches, key=len))
return ["".join(match) for match in matches if len(match)==maxlen]
</code></pre>
<p>测试用例:</p>
^{pr2}$
<p><a href="https://stackoverflow.com/a/19562798/20670">Explanation can be found here</a>(对该代码稍作修改)。在</p>