RUN__IT # 05 python求最长回文子串

给定一个字符串s,找到s中最长回文子串。
如:
输入:“babad”
输出:bab,aba也符合要求

主要用到切片。如果有更好的方法请指导!


def main(s):
    res = str()
    for i in range(len(s)):
        for j in range(i + 1, len(s)):
            if s[i] == s[j]:
                if i != 0:
                    if s[i:j + 1] == s[j:i - 1:-1]:
                        if len(s[i:j + 1]) > len(res):
                            res = s[i:j + 1]
                        else:
                            break
                    else:
                        break
                else:
                    if s[i:j + 1] == s[j::-1]:
                        res = s[i:j + 1]
                    else:
                        break
    return res


if __name__ == '__main__':
    # s = "1h23454321"
    s = "abcdcb"
    print(main(s))

猜你喜欢

转载自blog.csdn.net/RUN__IT/article/details/89390665