题解 | #最长回文子串#

/**
 * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
 *
 *
 * @param A string字符串
 * @return int整型
 */
int getLongestPalindrome(char* A ) {
    // write code here
    int len = strlen(A);
    int left;
    int right;
    if (len == 0)
        return 0;
    right = len - 1;
    int max = 0;
    int count = 0;
    for (left = 0; left < len; left++) {
        for (right = len - 1; right >= left; right--) {
            int countl = left;
            int rightr = right;
            while (A[countl] == A[rightr] && countl < rightr) {
                count = count + 2;
                countl++;
                rightr--;
                if (countl == rightr) {
                    count++;
                    break;
                }
            }
            if (countl != rightr && countl != rightr + 1)
                count = 0;
            if (right == left) {
                count = 1;
            }
            if (max < count)
                max = count;
            count = 0;
        }
    }
    return max;
}