回文串之中心扩展法

中心扩展法可以帮助减少在回文子串中暴力遍历的一次循环，在普通暴力遍历中，我们需要两次循环分别确定左指针和右指针（即回文子串的左右边界），然后还有一次循环向中间靠拢判断。

中心扩展法将向中心靠拢的这一步改为了由中心向两边延申，由于回文子串有奇数和偶数之分，所以中心扩展法的起始点需要分两种情况讨论，即在遍历变量i在遍历的过程中，分别需要从i，i，和i，i+1开始。

class Solution:
    def countSubstrings(self, s: str) -> int:
        # 中心扩展
        len_s = len(s)
        if len_s == 0:
            return 0
        res = 0
        for i in range(len_s):
            l_tmp, r_tmp = i, i
            while l_tmp>=0 and r_tmp<len_s and s[l_tmp] == s[r_tmp]:
                res += 1
                l_tmp -= 1
                r_tmp += 1
            l_tmp2, r_tmp2 = i, i+1
            while l_tmp2>=0 and r_tmp2<len_s and s[l_tmp2] == s[r_tmp2]:
                res += 1
                l_tmp2 -= 1
                r_tmp2 += 1
        return res    

class Solution:
    def longestPalindrome(self, s: str) -> str:
        len_s = len(s)
        if len_s == 0 or len_s == 1:
            return s
        max_len = 0
        max_l, max_r = 0, 0
        for i in range(len_s):
            l_tmp, r_tmp = i, i
            while l_tmp >= 0 and r_tmp < len_s and s[l_tmp] == s[r_tmp]:
                if r_tmp - l_tmp + 1 > max_len:
                    max_len = r_tmp - l_tmp + 1
                    max_l = l_tmp
                    max_r = r_tmp
                l_tmp -= 1
                r_tmp += 1
            l_tmp2, r_tmp2 = i, i+1
            while l_tmp2 >= 0 and r_tmp2 < len_s and s[l_tmp2] == s[r_tmp2]:
                if r_tmp2 - l_tmp2 + 1 > max_len:
                    max_len = r_tmp2 - l_tmp2 + 1
                    max_l = l_tmp2
                    max_r = r_tmp2
                l_tmp2 -= 1
                r_tmp2 += 1
        return s[max_l:max_r+1]