题解 | 最长回文子串

import java.util.*;


public class Solution {
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     *
     * @param A string字符串
     * @return int整型
     */
    public int getLongestPalindrome (String A) {
        char[] charArray = A.toCharArray();

        int[] res = new int[charArray.length];
         int max = 0;
        for (int c = 0; c < charArray.length; c++) {
            int i = c;
            int j = c;
            int len =1;
            i--;
            while (i >= 0){
                if (charArray[i] == charArray[j]) {
                    len = len + 1;
                    max = Math.max(max,len);
                    i--;
                }else {
                    break;
                }
            }
            max = Math.max(max,len);
            j++;
            while (i>=0 && j< charArray.length && charArray[i] == charArray[j]) {
                len = len + 2;
                max = Math.max(max,len);
                i--;
                j++;
            }
        }
        return max;
    }
}