Open xianzao opened 1 year ago
/**
* @param {string} s
* @return {string}
*/
var longestPalindrome = function(s) {
let max = 0,
start = -1;
for (let i = 0; i < s.length; i++) {
let left = i - 1,
tmp = 1;
while(s[i] === s[i+1]) {
tmp++;
i++;
}
let right = i + 1;
while(s[left] === s[right] && s[left] !== undefined) {
left--;
right++;
tmp += 2;
}
if (max < tmp) {
max = tmp;
start = left + 1;
}
}
return s.slice(start, start + max)
};
给你一个字符串 s,找到 s 中最长的回文子串。
示例1
示例2
提示: