每日一练:算法题

给定一个字符串 s，找到 s 中最长的回文子串。你可以假设 s 的最大长度为 1000。

示例 1：
输入: “babad”
输出: “bab”
注意: “aba” 也是一个有效答案。

示例 2：
输入: “cbbd”
输出: “bb”

```python
# -*- coding: utf-8 -*-
# 给定字符串 s 和 t ，判断 s 是否为 t 的子序列。
import time
def longestPalindrome(s):
    start, maxl = 0, 0
    for i, x in enumerate(s):
        if i - maxl >= 1 and s[i - maxl - 1:i + 1] == s[i - maxl - 1:i + 1][::-1]:
            start = i - maxl - 1
            maxl += 2
        if i - maxl >= 0 and s[i - maxl:i + 1] == s[i - maxl:i + 1][::-1]:
            start = i - maxl
            maxl += 1
    return s[start:start + maxl]

def longestPalindrome1(s):
    str_length = len(s)
    max_length = 0
    start = 0
    for i in range(str_length):
        if i - max_length >= 1 and s[i - max_length - 1:i + 2] == s[i - max_length - 1:i + 2][::-1]:
            start = i - max_length - 1
            max_length += 2
            continue
        if i - max_length >= 0 and s[i - max_length:i + 2] == s[i - max_length:i + 2][::-1]:
            start = i - max_length
            max_length += 1
    return s[start:start + max_length + 1]


def longestPalindrome2(s):
    n = len(s)
    dp = [[0] * n for _ in range(n)]
    max_len = float("-inf")
    res = ""
    for i in range(n):
        # dp[i][i] = 1
        for j in range(i, -1, -1):
            if s[i] == s[j] and (i - j < 2 or dp[i - 1][j + 1]):
                dp[i][j] = 1

            if dp[i][j] and i - j + 1 > max_len:
                max_len = i - j + 1
                res = s[j:i + 1]
    # print(dp)
    return res

def longestPalindrome3( s):
    """
    :type s: str
    :rtype: str
    """
    n = len(s)
    if n < 2 or s == s[::-1]:
        return s
    max_len = 1
    start = 0
    for i in range(1, n):
        even = s[i - max_len:i + 1]
        odd = s[i - max_len - 1:i + 1]
        if i - max_len - 1 >= 0 and odd == odd[::-1]:
            start = i - max_len - 1
            max_len += 2
            continue
        if i - max_len >= 0 and even == even[::-1]:
            start = i - max_len
            max_len += 1
    return s[start:start + max_len]

if __name__ == '__main__':
    start = time.clock()
    
    # 中间写上代码块
    # yy=longestPalindrome('123456543')
    # yy1=longestPalindrome1('123456543')
    yy3 = longestPalindrome3('123456543')
    end = time.clock()    
    # 中间写代码块
    print('Running time: %s m Seconds' % ((end - start)*1000))
    print(yy3)