Alphabetical Substrings

最新推荐文章于 2021-07-30 18:56:14 发布

matdodo

最新推荐文章于 2021-07-30 18:56:14 发布

阅读量1.1k

点赞数

分类专栏： python 文章标签： python

本文链接：https://blog.csdn.net/myjiayan/article/details/23371671

版权

python 专栏收录该内容

75 篇文章 4 订阅

订阅专栏

Assume s is a string of lower case characters.

Write a program that prints the longest substring of s in which the letters occur in alphabetical order. For example, ifs = 'azcbobobegghakl', then your program should print

Longest substring in alphabetical order is: beggh

In the case of ties, print the first substring. For example, if s = 'abcbcd', then your program should print

Longest substring in alphabetical order is: abc

s='abcbcd'

count=1
result=s[0]
while s:
    newcount=1
    newresult=''
    i=0
    while i+1<len(s):
        if ord(s[i])<=ord(s[i+1]):
            newresult+=s[i+1]
            newcount+=1
        else:
            break
        i+=1
    if newcount>count:
        count=newcount
        result=s[0]+newresult
    s=s[i+1:]
print result