原题传送门

1. 问题描述

2. Solution

参考LeetCode5 Longest Palindromic Substring

import sys  if sys.platform != linux:     file_in = open(input/HJ32.txt)     sys.stdin = file_in   def solve(s):     n = len(s)     dp = [[False] * n for _ in range(n)]     max_len = 0     for j in range(n):         for i in range(j):             dp[i][j] = s[i] == s[j] and ((j - i <= 2) or dp[i + 1][j - 1])             if dp[i][j] and (j - i + 1 > max_len):                 max_len = j - i + 1     print(max_len)   for line in sys.stdin:     solve(line.strip())