Leetcode 5. Longest Palindromic Substring

3 solutions-Dynamic Programming & Expand Around Center &

Solution 1 Dynamic Programming
The process of compute dp[i][j] is showed as following:

1. 00
2. 00 01
   11
3. 00 01 02
   11 12
   22
4. 00 01 02 03
   11 12 13
   22 23
   33

class Solution {
public String longestPalindrome(String s) {
        if(s==null){
            return "";
        }
        int l=s.length(); int max=0; String res="";
        boolean [][] dp =new boolean[l][l];
        for(int j=0;j<l;j++){
            for(int i=0;i<=j;i++){
                dp[i][j]=s.charAt(i)==s.charAt(j) && (j-i<=2||dp[i+1][j-1]);
                if(dp[i][j]){
                    if(j-i+1>max){
                        max=j-i+1;
                        res=s.substring(i, j + 1);
                    }
                }
            }
        }
        return res;
    }
}

Complexity Analysis

Time complexity : O(n²).
Space complexity : O(n²).

Solution 2 Expand Around Center
In fact, we could solve it in O(n²) time using only constant space.
We observe that a palindrome mirrors around its center. Therefore, a palindrome can be expanded from its center, and there are only 2n−1 such centers.

You might be asking why there are 2n-1 but not n centers? The reason is the center of a palindrome can be in between two letters. Such palindromes have even number of letters (such as “abba”) and its center are between the two 'b’s.

public String longestPalindrome(String s) {
    if (s == null || s.length() < 1) return "";
    int start = 0, end = 0;
    for (int i = 0; i < s.length(); i++) {
        int len1 = expandAroundCenter(s, i, i);
        int len2 = expandAroundCenter(s, i, i + 1);
        int len = Math.max(len1, len2);
        if (len > end - start) {
            start = i - (len - 1) / 2;
            end = i + len / 2;
        }
    }
    return s.substring(start, end + 1);
}

private int expandAroundCenter(String s, int left, int right) {
    int L = left, R = right;
    while (L >= 0 && R < s.length() && s.charAt(L) == s.charAt(R)) {
        L--;
        R++;
    }
    return R - L - 1;
}

Complexity Analysis

Time complexity : O(n²).
Space complexity : O(1).

Solution 3 Manacher’s Algorithm

https://articles.leetcode.com/longest-palindromic-substring-part-ii/