题解 | #编号子回文I#

class Solution {
public:
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     * 
     * @param s string字符串 
     * @return string字符串
     */
    bool isPalindrome(string s, int start, int end) {
        while (start < end) {
            if (s[start++] != s[end--]) {
                return false;
            }
        }
        return true;
    }
    string longestPalindrome(string s) {
        // write code here
        int maxLen = 1;
        int left = 0, right = 0;
        for (int i = 0; i < s.size(); i++) {
            for (int j = i+maxLen; j < s.size(); j++) {
                if (isPalindrome(s, i, j)) {
                    if (j-i+1 > maxLen) {
                        maxLen = j-i+1;
                        left = i;
                        right = j;
                    }
                }
            }
        }
        return s.substr(left, maxLen);

    }
};