LeetCode Medium Longest Palindromeic Substring

Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000.

Example 1:

Input: "babad"
Output: "bab"
Note: "aba" is also a valid answer.

Example 2:

Input: "cbbd"
Output: "bb"

Solution1

DP思想

状态转移方程：

dp[i][j] = dp[i+1][j-1] == 1 && s[i] == s[j] ? 1 : 0

但是要注意的是，如果按照i和j从小到大的顺序来枚举子串的两个端点，然后更新dp的话，会无法保证dp[i+1][j-1]已经被计算过，从而无法得到正确的dp

一个解决办法时对子串的长度进行枚举

char* longestPalindrome(char* s) {
    int len = strlen(s);
    if (len == 0) return "";
    int i, j, L, start = 0, end = 0;
    char dp[len][len];
    memset(dp, 0, sizeof(dp));
    for (i = 0; i < len; i++) {
        dp[i][i] = 1;
        if (i < len - 1) {
            if (s[i] == s[i+1]) {
                dp[i][i+1] = 1;
                start = i;
                end = i + 1;
            }
        }
    }
    
    // 对子串长度进行递增循环
    for (L = 3; L <= len; L++) {
        for (i = 0; i + L - 1 < len; i++) {
            j = i + L - 1;
            if (s[i] == s[j] && dp[i+1][j-1] == 1) {
                dp[i][j] = 1;
                start = i;
                end = j;
            }
        }
    }
    
    char* ans = calloc(end - start + 2, sizeof(char));
    for (i = start; i <= end; i++) {
        ans[i - start] = s[i];
    }
    
    return ans;
}

Solution2

扫描

这是一个比较巧的方法，先找到可能的回文串的中间，然后从中间向两头进行扩散，复杂度为线性，而且空间复杂度为常数！

char* longestPalindrome(char* s) {
    int len = strlen(s);
    if (len < 2) return s;
    int start = 0, end = 0;
    int max = 0;
    int i = 0;
    while (i < len) {
        int l = i;
        int r = i;
        while (r < len - 1 && s[r] == s[r + 1]) {
            r++;
        }
        i = r + 1;
        while (l > 0 && r < len - 1 && s[l - 1] == s[r + 1]) {
            r++;
            l--;
        }
        if (r - l + 1 > max) {
            max = r - l + 1;
            start = l;
            end = r;
        }
    }
    
    
    char* ans = calloc(end - start + 2, sizeof(char));
    for (i = start; i <= end; i++) {
        ans[i - start] = s[i];
    }
    
    return ans;
}