LeetCode算法题--最长回文子串

LeetCode算法题–最长回文子串

• 题目来源：https://leetcode-cn.com/problems/longest-substring-without-repeating-characters/

• 题目要求

输入: “babad”
输出: “bab”
注意: “aba” 也是一个有效答案。

题目思路：

无思路。。。官方的中心扩展算法也好难懂啊。。还得再琢磨。

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;
}