Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000.
Example 1:
Input: "babad"
Output: "bab"
Note: "aba" is also a valid answer.
Example 2:
Input: "cbbd"
Output: "bb"
思路:最简单的暴力破解,找出所有的子串,一一判断是不是回文串,找出最长的。
package com.Ryan;
public class LongestPalindromicSubstring {
public static void main(String[] args) {
String string = "cbbd";
System.out.println(longestPalindrome(string));
}
static String longestPalindrome(String s) {
if (s.length()<=1) {
return s;
}
String longestPalindromeString = "";
for (int i = 0; i <= s.length(); i++) {
for (int j = i + 1; j <= s.length(); j++) {
String string = new String(s.substring(i, j));
if (isPalindrome(string)) {
longestPalindromeString = longestPalindromeString.length() > (j - i) ? longestPalindromeString : s.substring(i, j);
}
}
}
return longestPalindromeString;
}
private static boolean isPalindrome(String string) {
// TODO Auto-generated method stub
if (string.length()<=1) {
return true;
}
int len=string.length();
int mid=string.length()/2;
boolean istrue=false;
for (int i = 0; i < mid; i++) {
if (string.charAt(i)==string.charAt(len-i-1)) {
istrue=true;
}
else {
istrue=false;
break;
}
}
return istrue;
}
}