回文串

Longest Palindromic Substring (Medium)

问题描述

一串字符串，正向读和反向读，结果一样则成为回文字符串，现给出一个字符串，求其最长子回文字符串并输出。LeetCode 直接打的，没有写repo

Examples 1
Input
"babad"
Output
"bab"

Examples 2
Input
"cbbd"
Output
"bb"

算法思路

• 由中心向两边扩展

• 两边字符不一致时，局部最优解为扩展之前的解

AC 代码

string longestPalindrome(string s) {
    int maxlen = 1;
    int start = 0;
    for (int mid = 0; mid < s.length() - 1; mid++) {
        // when odd
        midExpand(s, mid, mid, maxlen, start);
        // when even
        midExpand(s, mid, mid + 1, maxlen, start);
        
    }
    return s.substr(start, maxlen);
}

void midExpand(string s, 
               int l, 
               int r, 
               int &maxlen,
               int &start) {
    // the mid expands to two sides
    while (l >= 0 && r < s.length()) {
        if (s[l] != s[r]) {
            break;
        }
        l--;
        r++;
    }
    // move 'l' right once to real left, same as 'r' 
    if (maxlen < r - l - 1) {
        maxlen = r - l - 1;
        start = l + 1;
    }
}