I. Description
Given a string s, s to find the longest substring palindromic.
II. Code
public String longestPalindrome(String s) {
if (s == null || s.length() == 0) {
return "";
}
int longest=s.length();
int start=0;
while(longest>0)
{
int i=0;
start=i;
int j=i+longest-1;
boolean exit=true;
while(i<j)
{
if(s.charAt(i)==s.charAt(j))
{
i++;
j--;
}else
{
i=start+1;
if(i+longest>s.length())
{
exit=false;
break;
}
start=i;
j=i+longest-1;
}
}
if(exit)
{
break;
}
longest--;
}
return s.substring(start,start+longest);
}