题解 | #最长回文子串#

class Solution {
  public:

    int huiwen(string A, int i, int j) {

        int ret = j - i + 1;
        while (i < j) {
            if (A[i] != A[j]) {
                return 0;
            }
            i++;
            j--;
        }
        return ret;
    }
    int getLongestPalindrome(string A) {
        int n = A.size();
        if (n <= 1) {
            return n;
        }
        int ret = 1;
        for (int i = 0; i < n; i++) {
            for (int j = i + 1; j < n; j++) {
                if (A[j] == A[i]) {
                    int x = huiwen(A, i, j);
                    if (x > ret) ret = x;
                }
            }
        }

        return ret;
    }
};