[5. 最长回文子串](https://leetcode.cn/problems/longest-palindromic-substring/)
难度:Medium
思路
- 目标: O ( n 2 ) O(n^2) O(n2)
- 枚举中心(回文串的中心元素)
- 综合奇数和偶数情况讨论
C++ 解法:
class Solution {
public:
string longestPalindrome(string s) {
string str;
for (int i = 0; i < s.size(); i ++)
{
int l = i - 1, r = i + 1;
while(l >= 0 && r <= s.size() && s[l] == s[r]) l --, r ++;
if (str.size() < r - l - 1) str = s.substr(l + 1, r - l - 1);
l = i, r = i + 1;
while(l >= 0 && r <= s.size() && s[l] == s[r]) l --, r ++;
// substr(startIndex, length)
// 指从startIndex处开始(包括startIndex)length长度个字符的子串
if (str.size() < r - l - 1) str = s.substr(l + 1, r - l - 1);
}
return str;
}
};
Java解法
class Solution {
public String longestPalindrome(String s) {
String str = "";
for (int i = 0; i < s.length(); i ++)
{
int l = i - 1, r = i + 1;
while(l >= 0 && r < s.length() && s.charAt(l) == s.charAt(r)){
l --; r ++;
}
if (r - l - 1 > str.length()) str = s.substring(l + 1, r);
l = i; r = i + 1;
while(l >= 0 && r < s.length() && s.charAt(l) == s.charAt(r)){
l --; r ++;
}
// substring(startIndex,endIndex)
// 其中[startIndex, endIndex) 左闭右开
if (r - l - 1 > str.length()) str = s.substring(l + 1, r);
}
return str;
}
}
Python解法
class Solution:
def longestPalindrome(self, s: str) -> str:
start, end = 0, 0
for i in range(len(s)):
left1, right1 = self.expandAroudCenter(s, i, i)
left2, right2 = self.expandAroudCenter(s, i, i + 1)
if right1 - left1 > end - start:
start, end = left1, right1
if right2 - left2 > end - start:
start, end = left2, right2
return s[start: end + 1] # 这里和java一样左闭右开所以要加1
# 获得回文中心的边界,听说封装成函数面试官更喜欢hh
def expandAroudCenter(self, s, left, right) -> int:
while left >= 0 and right < len(s) and s[left] == s[right]:
left -=1
right += 1
return left + 1, right - 1