题解 | #最长回文子串#

const rl = require("readline").createInterface({ input: process.stdin });
var iter = rl[Symbol.asyncIterator]();
const readline = async () => (await iter.next()).value;


var longestPalindrome = function(s) {
 let l=0,r=0
 for(let i=0;i<s.length;i++){
searchPalindrome(i,i)
searchPalindrome(i,i+1)

 }
function searchPalindrome(m,n){
    while(m>=0&&n<s.length&&s[m]===s[n]){
        m--
        n++
    }
    if(n-m-1>r-l-1){
        r=n
        l=m
    }
}
return s.slice(l+1,r)
};
void async function () {
    // Write your code here
    while(line = await readline()){
        let tokens = line.split(' ');
        let a = parseInt(tokens[0]);
        let b = parseInt(tokens[1]);
        console.log(longestPalindrome(line).length);
    }
}()