Problem5：Longest Palindromic Substring

看了好几遍才整明白的解法，先整理出来，留着后面忘记了可以翻看~~~~~~~~

题目：

Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000.

Example:

Input: "babad"

Output: "bab"

Note: "aba" is also a valid answer.

Example:

Input: "cbbd"

Output: "bb"

class Solution {
   public String longestPalindrome(String s) { 
       int start=0,end=0;
       for(int i=0;i<s.length();i++){
           int len1=expandAroundCenter(s,i,i);
           int len2=expandAroundCenter(s,i,i+1);
           int len=Math.max(len1,len2);
           if(len>end-start){
               start=i-(len-1)/2;
               end=i+len/2;
           }
       }
       return s.substring(start,end+1);
    }
	public int expandAroundCenter(String s,int left,int right){
		int L=left,R=right;
        while(L>=0&&R<s.length()&&s.charAt(L)==s.charAt(R)){
            L--;
            R++;
        }
        return R-L-1;
	}
}