目录
题目描述:
给你一个字符串 s,找到 s 中最长的回文子串。
示例 1:
输入:s = "babad"
输出:"bab"
解释:"aba" 同样是符合题意的答案。
示例 2:
输入:s = "cbbd"
输出:"bb"
示例 3:
输入:s = "a"
输出:"a"
示例 4:
输入:s = "ac"
输出:"a"
提示:
1 <= s.length <= 1000
s 仅由数字和英文字母(大写和/或小写)组成
解法思路:
1.暴力解法
从长度为s.length()-1的字串开始查找,直接先reverse再用equals与原字串判等,找到了直接返回这个字串。
public class Solution {
public static void main(String[] args) {
long l1 = System.currentTimeMillis();
System.out.println(longestPalindrome("\"uyjswxastuxsmaqmqwlwftpyyqtkqnchtxktvfxcrdyyxpmoavmfrsxfzvtaqerqucblrcsunnhyfalunvptqqeqqdgchneaolymeurjzwvefqlgncikrfudqudbwvcilmyavughvnfnrfndyqlzdjckjxyhpaquaaauwbufpgyuwlnuzwlegcvjgpqgdrmtcgqcqyerriohnjaxmzpchoihjxuqlurummdutrgtbbpogqlcwdsxlrwgznyrnoohmstfxwxxwxftsmhoonrynzgwrlxsdwclqgopbbtgrtudmmurulquxjhiohcpzmxajnhoirreyqcqgctmrdgqpgjvcgelwzunlwuygpfubwuaaauqaphyxjkcjdzlqydnfrnfnvhguvaymlicvwbduqdufrkicnglqfevwzjruemyloaenhcgdqqeqqtpvnulafyhnnuscrlbcuqreqatvzfxsrfmvaompxyydrcxfvtkxthcnqktqyyptfwlwqmqamsxutsaxwsjyu\""));
long l2 = System.currentTimeMillis();
System.out.println(l2 - l1 + "ms");
}
//暴力解法,超时
public static String longestPalindrome(String s) {
String t = "";
for (int i = 1; i < s.length()+1; i++) {
for (int j = 0; j < s.length() - i + 1; j++) {
String substring = s.substring(j, j + i);
boolean equals = substring.equals(new StringBuilder(substring).reverse().toString());
if (equals == true && substring.length()>t.length())
t = substring;
}
}
return t;
}
}
查找成功,但是再查找长的字符串时会超时。
2.中间往两边扩展解法(左右指针法/双指针法)
及选定一个或两个字符,从中间往两边不断扩展,直到左右字符不相等,最长的回文子串就被找出来了。
public class Solution {
public static void main(String[] args) {
long l1 = System.currentTimeMillis();
System.out.println(longestPalindrome("\"uyjswxastuxsmaqmqwlwftpyyqtkqnchtxktvfxcrdyyxpmoavmfrsxfzvtaqerqucblrcsunnhyfalunvptqqeqqdgchneaolymeurjzwvefqlgncikrfudqudbwvcilmyavughvnfnrfndyqlzdjckjxyhpaquaaauwbufpgyuwlnuzwlegcvjgpqgdrmtcgqcqyerriohnjaxmzpchoihjxuqlurummdutrgtbbpogqlcwdsxlrwgznyrnoohmstfxwxxwxftsmhoonrynzgwrlxsdwclqgopbbtgrtudmmurulquxjhiohcpzmxajnhoirreyqcqgctmrdgqpgjvcgelwzunlwuygpfubwuaaauqaphyxjkcjdzlqydnfrnfnvhguvaymlicvwbduqdufrkicnglqfevwzjruemyloaenhcgdqqeqqtpvnulafyhnnuscrlbcuqreqatvzfxsrfmvaompxyydrcxfvtkxthcnqktqyyptfwlwqmqamsxutsaxwsjyu\""));
long l2 = System.currentTimeMillis();
System.out.println(l2 - l1 + "ms");
}
public static String longestPalindrome(String s) {
int length = s.length();
String ans = "";
//查找长度为奇数的最长回文子串
for (int i = 0; i < s.length(); i++) {
//左右指针
int left = i, right = i;
ans = getString(s, length, ans, left, right);
}
//查找长度为偶数的回文串
for (int i = 0; i < s.length() - 1; i++) {
//左右指针
int left = i, right = i + 1;
ans = getString(s, length, ans, left, right);
}
return ans;
}
private static String getString(String s, int length, String ans, int left, int right) {
while (left >= 0 && right < length) { //左右指针不能越界
if (s.charAt(left) != s.charAt(right)) { //若左右指针的字符不相等
if (right - left - 1 > ans.length()) //查找结束,[left+1,right)为回文串
ans = s.substring(left + 1, right); //若为当前最长,更新回文串
break;
} else if (left == 0 || right == length - 1) { //左右指针的字符相等但是左或右指针碰到边界了
if (right - left + 1 > ans.length()) //查找结束,[left,right+1)为回文串
ans = s.substring(left, right + 1); //若为当前最长,更新回文串
break;
}
left--;
right++;
}
return ans;
}
}
仅用时1ms,可见这种方法时间复杂度要低很多。