Leetcode Shortest palindrome

Given a string S, you are allowed to convert it to a palindrome by adding characters in front of it. Find and return the shortest palindrome you can find by performing this transformation.

For example:

Given “aacecaaa”, return “aaacecaaa”.

Given “abcd”, return “dcbabcd”.

---

从string中间元素开始向左，找到最长的panlindrome。
因为左边一定是s.charAt(0), 所以最中间的元素可以唯一表示一个panlindrome， odd 长度时是中间两个.
O(n^2)

public class Solution {
    public String shortestPalindrome(String s) {
        if(s.length()<=1)return s;
        int i=(s.length()-1)/2;
        if(s.length()%2!=0 )
        {
            if(isPanlindrome(s,i,i))return "";
            i--;
        }
        while(i>=0)
        {
            if(isPanlindrome(s,i,i+1))
            {
                String add=s.substring(2*i+2, s.length());
                return new StringBuffer(add).reverse().append(s).toString();
            }
            if(isPanlindrome(s,i,i))
            {
                String add=s.substring(2*i+1, s.length());
                return new StringBuffer(add).reverse().append(s).toString();
            }
            i--;
        }
        return "";
    }

    boolean isPanlindrome(String s, int i, int j)
    {
        while(i>=0 && j<s.length())
        {
            if(s.charAt(i--)!=s.charAt(j++))return false;
        }
        return true;
    }
}