最大回文子串

public class LongestPalindromicSubstring
{
public LongestPalindromicSubstring(){}

public String longestPalindrome(String s) 
{
	int maxlength= 0;
	
	int start= 0;int end= 0;
	
    for(int i=0;i<s.length();i++)
    {
    	for(int j=s.length();j>i;j--)
    	{
    		if(s.charAt(i) == s.charAt(j-1) && j-i > maxlength)
    		{
    			if(isPalindrome(s, i, j))
    			{
    				maxlength= j-i;
    			    start=i;end=j;
    			}
    		}
    	}
    }
    return s.substring(start, end);
}

private boolean isPalindrome(String s, int start, int end)
{
	int low= start;int high= end-1;
	while(low < high)
	{
		if(s.charAt(low) != s.charAt(high))
		{return false;}
		low++;high--;
	}
	return true;
}

}