题解 | #密码截取#

非暴力最长回文子串

import sys
class HW(object):
    def longHW(self):
        self.s = sys.stdin.readline().strip()
        self.res = ''
        def huiwen(i ,j):
            while(i >= 0 and j < len(self.s) and self.s[i] == self.s[j]):
                i -= 1
                j += 1
                if j - i -1 > len(self.res):
                    self.res = self.s[i+1:j]
        for i in range(len(self.s)):
            if len(self.res) == len(self.s):
                return len(self.res)
            huiwen(i, i)
            huiwen(i, i+1)
        return len(self.res)
    
if __name__ == '__main__':
    hw = HW()
    print(hw.longHW())