题解 | #最长回文子串#

/**
 * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
 *
 * 
 * @param A string字符串 
 * @return int整型
 */
function getLongestPalindrome( A ) {
    // write code here
    A = A.split('')
    if(A.length === 1) return 1
    let maxSize = 1
    const compare = (left, right) => {
        let size = 1
        while(left >= 0 && right < A.length && A[left] === A[right]) {
            size = right - left + 1
            left--;
            right++;
        }
        return size
    }
    console.log(A)
    for(let i = 0; i< A.length - 1; i++) {
        console.log(i, '+88+',compare(i, i))
        maxSize = Math.max(maxSize, compare(i, i), compare(i, i + 1))
    }
    return maxSize
}
module.exports = {
    getLongestPalindrome : getLongestPalindrome
};