class Solution {
public:
string longestPalindrome(string s) {
if (s.size() == 0) return "";
string res;
int len = 0;
// 处理处理偶数, k代表偶数下标
for (int k = 0; k < s.size(); k++) {
int i = k, j = k+1;
while (i >= 0 && j <= s.size() && s[i] == s[j]) {
i--;
j++;
}
if (j - i - 1 > len) {
len = j - i - 1;
res = s.substr(i+1, len);
}
}
// 处理处理奇数, k代表奇数下标
for (int k = 0; k < s.size(); k++) {
int i = k-1, j = k+1;
while (i >= 0 && j <= s.size() && s[i] == s[j]) {
i--;
j++;
}
if (j - i - 1 > len) {
len = j - i - 1;
res = s.substr(i+1, len);
}
}
return res;
}
};
leetcode5. Longest Palindromic Substring
最新推荐文章于 2022-10-24 21:03:12 发布