leetcode--005. Longest palindromic Substring

Longest palindromic Substring test Instructions

Give a string to find the longest palindrome substring. Solving

Each character in the string is extended to the left and right, and a palindrome substring is found.
Palindrome string length can be odd, or even, it should be noted.

Class Solution {public
:
    //88ms
    string Longestpalindrome (string s) {
        string ans;
        for (int i = 0; i < s.length (); ++i) {
            string oddstr = Getpalin (s, I, I);
            if (Oddstr.length () > Ans.length ()) ans = oddstr;

            String evenstr = Getpalin (s, I, i + 1);
            if (Evenstr.length () > Ans.length ()) ans = evenstr;
        }
        return ans;
    }

    String Getpalin (string& s, int l, int r) {while
        (l >= 0 && R < s.length () && s[l] = = S[r]) l --, r++;
        Return S.substr (L + 1, r-l-1);
    }
};