按字母顺序查找最长的子串

问题描述

我在另一个主题上找到了这段代码，但它按连续字符而不是按字母顺序对子字符串进行排序.如何按字母顺序更正它?它打印出lk，我想打印ccl.谢谢

I have this code that I found on another topic, but it sorts the substring by contiguous characters and not by alphabetical order. How do I correct it for alphabetical order? It prints out lk, and I want to print ccl. Thanks

ps:我是 Python 初学者

ps: I'm a beginner in python

s = 'cyqfjhcclkbxpbojgkar'
from itertools import count

def long_alphabet(input_string):
    maxsubstr = input_string[0:0] # empty slice (to accept subclasses of str)
    for start in range(len(input_string)): # O(n)
        for end in count(start + len(maxsubstr) + 1): # O(m)
            substr = input_string[start:end] # O(m)
            if len(set(substr)) != (end - start): # found duplicates or EOS
                break
            if (ord(max(sorted(substr))) - ord(min(sorted(substr))) + 1) == len(substr):
                maxsubstr = substr
    return maxsubstr

bla = (long_alphabet(s))
print "Longest substring in alphabetical order is: %s" %bla

推荐答案

尝试改变这个:

        if len(set(substr)) != (end - start): # found duplicates or EOS
            break
        if (ord(max(sorted(substr))) - ord(min(sorted(substr))) + 1) == len(substr):

为此:

        if len(substr) != (end - start): # found duplicates or EOS
            break
        if sorted(substr) == list(substr):

这将为您的示例输入字符串显示 ccl.代码更简单，因为您正在尝试解决更简单的问题:-)

That will display ccl for your example input string. The code is simpler because you're trying to solve a simpler problem :-)

这篇关于按字母顺序查找最长的子串的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持！