给一个字符串S,找到S中最长的回文子串;
1 <= s.length <= 1000;
s仅由数字和英文字母(大小写)组成
回文子串指的是中间向两边扩展都是一样的,类似’aba’,‘aa’,‘abcba’…
var longestPalindrome = function(s) {
if ( s.length < 2) return s;
let str = '';
for( let i = 0; i < s.length; i++){
const str1 = getStr(s, i,i)
const str2 = getStr(s, i,i+1)
if( str1.length > str.length || str2.length > str.length ){
str = str1.length > str2.length ? str1 : str2
}
}
return str
}
var getStr = ( s, i , j) => {
if( s[i] != s[j] ) return ''
let L = i , R = j ;
while( L > 0 && R < s.length && s[L-1] == s[R+1] ){
L--;
R++;
}
return s.substring(L,R+1)
}