最长的回文子串

最长回文子串

解题思路

var longestPalindrome = function(s) {
    //边界限制
    if(s.length<2){
         return s;
    }
    let start=0;
    let maxLength=1;
        function expand(left,right){
            while(left>=0 && right<=s.length&& s[left]===s[right]){
        if(right-left+1>maxLength){
            //找到更大的回文子字符串
            maxLength=right-left+1;
            start=left;
        }
            left--;
            right++;
    }
}
for(let i=0;i<s.length;i++){
    expand(i-1,i+1);
    expand(i,i+1);
}
return s.substring(start,start+maxLength);
};