题解 | 最长回文子串

class Solution {
  public:
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     *
     * @param A string字符串
     * @return int整型
     */
    int getLongestPalindrome(string A) {
        // write code here
        int n = A.size();
        if (n == 1) {
            return 1;
        }

        int maxlen = 1;
        for (int i = 0; i < n; i++) {
            int left = i;
            int right = i;
            while (left >= 0 && right < n && A[left] == A[right]) {
                int len = right - left + 1;
                maxlen = max(len, maxlen);
                left--;
                right++;
            }
        }
        for (int i = 0; i < n; i++) {
            int left = i;
            int right = i+1;
            while (left >= 0 && right < n && A[left] == A[right]) {
                int len = right - left + 1;
                maxlen = max(len, maxlen);
                left--;
                right++;
            }
        }
        return maxlen;
    }
};