题解 | #最长回文子串#

import java.util.*;

public class Solution {
    public int getLongestPalindrome(String A, int n) {
        if(n<2) return A.length();
        String B=new String(new StringBuilder(A).reverse());
        int ret=0,k1,k2,i,j;
        for(i=0;i<A.length();i++)
        {
            for(j=i+1;j<A.length();j++)
            {
                for(k1=i,k2=A.length()-1-j;k1<=j; k1++,k2++)
                {
                   if(B.charAt(k2)!=A.charAt(k1))
                  {
                      break;
                  }
                }//for
                
                if(k1==j+1)
                {
                      ret= Math.max(ret,k1-i);
                }
            }//for
        }//for
        return ret;
    }

}