最长回文子串中心扩展和动态规划方法

public class LongestPalindrome {
//https://blog.csdn.net/tiankong_12345/article/details/102018257?utm_medium=distribute.pc_relevant.none-task-blog-BlogCommendFromMachineLearnPai2-1.channel_param&depth_1-utm_source=distribute.pc_relevant.none-task-blog-BlogCommendFromMachineLearnPai2-1.channel_param#3.2%C2%A0%E4%B8%AD%E5%BF%83%E6%89%A9%E5%B1%95%E7%AE%97%E6%B3%95

//#########################################################################
    public static String longestPalindrome_center(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);
    }

    public static int expandAroundCenter(String s, int left, int right) {//返回以，left，right为中心的回文长度
        int L = left, R = right;
        while (L >= 0 && R < s.length() && s.charAt(L) == s.charAt(R)) {
            L--;
            R++;
        }
        return (R - 1) - (L + 1) + 1;
    }
    
    //#########################################################################
    public String longestPalindrome(String s) {//动态规划
        if ("".equals(s)) {
            return "";
        }
        int len = s.length();
        if (len == 1) {
            return s;
        }
        int sLength = 1;
        int start = 0;
        int[][] db = new int[len][len];//int[i][j] =1,表示i到j为回文。
        for (int i = 0; i < len; i++) {//定义初始化状态
            db[i][i] = 1;//一个字符的回文长度为1；
            if (i < len - 1 && s.charAt(i) == s.charAt(i + 1)) {//长度为2的回文情况
                db[i][i + 1] = 1;
                sLength = 2;
                start = i;
            }
        }
        for (int i = 3; i <= len; i++) {//遍历回文长度
            for (int j = 0; j + i - 1 < len; j++) {
                int end = j + i - 1;
                if (s.charAt(j) == s.charAt(end)) {
                    db[j][end] = db[j + 1][end - 1];//s.charAt(j) == s.charAt(end)的情况下，db[j][end]是否回文和db[j + 1][end - 1]相同
                    if (db[j][end] == 1) {//db[j][end] 回文，记录回文开始位置，回文长度
                        start = j;
                        sLength = i;
                    }
                }
            }
        }
        return s.substring(start, start + sLength);
    }
    

}