Lintcode 200. Longest Palindromic Substring (Medium) (Python)

Longest Palindromic Substring

Description:

Given a string S, find the longest palindromic substring in S. You may assume that the maximum length of S is 1000, and there exists one unique longest palindromic substring.

Example
Given the string = “abcdzdcab”, return “cdzdc”.

Challenge
O(n2) time is acceptable. Can you do it in O(n) time.

Code:

class Solution:
    """
    @param s: input string
    @return: the longest palindromic substring
    """
    def longestPalindrome(self, s):
        # write your code here
        res = ""
        resLength = 0

        for i in range(len(s)):
            rest = s[i]
            j = 1
            while i-j>=0 and i+j<len(s):
                if s[i-j]==s[i+j]:
                    rest = s[i-j]+rest+s[i+j]
                    j += 1
                else:
                    break
            if len(rest)>resLength:
                res = rest
                resLength = len(res)

        for i in range(len(s)-1):
            if s[i]!=s[i+1]:
                continue
            rest = s[i]+s[i+1]
            j = 1
            while i-j>=0 and i+j+1<len(s):
                if s[i-j]==s[i+j+1]:
                    rest = s[i-j]+rest+s[i+j+1]
                    j += 1
                else:
                    break
            if len(rest)>resLength:
                res = rest
                resLength = len(res)

        return res
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值