【lc刷题】5 最长回文子串_Day03

5. 最长回文子串

 
给定一个字符串 s，找到 s 中最长的回文子串。你可以假设 s 的最大长度为 1000。
 
示例 1：
 
输入: “babad”
输出: “bab”
注意: “aba” 也是一个有效答案。
示例 2：
 
输入: “cbbd”
输出: “bb”
 
If we use brute-force and check whether for every start and end position a substring is
a palindrome we have O(n^2) start - end pairs and O(n) palindromic checks.
Can we reduce the time for palindromic checks to O(1) by reusing some previous computation?
 

class Solution:
    # return a string
    def longestPalindrome_04(self, s):
    
        panlindrome = ''
        
        for i in range(len(s)):
        
            #某数对称 'bab'
            len1 = len(self.getlongestPalindrome(s,i,i))  
            if len1 > len(panlindrome):
                panlindrome = self.getlongestPalindrome(s,i,i)
                
            #中轴线对称 'bb'
            len2 = len(self.getlongestPalindrome(s,i,i+1))
            if len2 > len(panlindrome):
                panlindrome = self.getlongestPalindrome(s,i,i+1)  
                
        return panlindrome
        
    def getlongestPalindrome(self,s,pointer_l,pointer_r):
    
    	# 从此数向左右两边扩, 限定条件是左右指针不出框
        while pointer_l>=0 and pointer_r <len(s) and s[pointer_l] == s[pointer_r]:
            pointer_l -= 1
            pointer_r += 1
            
        #外扩的不合规，退出循环
        #返回往内缩
        return s[pointer_l+1:pointer_r]

刷新重写：

class Solution:
    def longestPalindrome(self, s: str) -> str:
        self.res = ''
        
        def helper(l, r):
            while l >=0 and r < len(s) and s[l] == s[r]:
                l -= 1; r += 1
            if len(self.res)< r - l -1:
                self.res = s[l+1:r]
        
        for i in range(len(s)):
            helper(i, i)
            helper(i, i+1)
            
        return self.res