Leetcode5.longest palindromic substring

笃定1109

于 2020-06-16 23:43:41 发布

阅读量161

点赞数

文章标签： leetcode python

本文链接：https://blog.youkuaiyun.com/weixin_40378100/article/details/106798060

版权

class Solution:
    def longestPalindrome(self, s):
        palindrome = ''
        for i in range(len(s)):

            l1 = len(self.getlongestpalindrome(s, i, i))
            if l1>len(palindrome):
                palindrome = self.getlongestpalindrome(s,i,i)
            l2 = len(self.getlongestpalindrome(s,i,i+1))
            if l2>len(palindrome):
                palindrome = self.getlongestpalindrome(s,i,i+1)
        return palindrome

    def getlongestpalindrome(self, s, l, r):
        while l >= 0 and r <= len(s) - 1 and s[l] == s[r]:
            l -= 1
            r += 1
        return s[l + 1:r]