【LeetCode 5. Longest Palindromic Substring】

Description：

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"

翻译

给定一个字符串 s，找到 s 中最长的回文子串(正读和反读都相同的字符串)。你可以假设 s 的最大长度为 1000。

分析

由于回文串是对称的，所以每次循环选择一个中心，进行左右扩展，判断左右字符是否相等即可。字符串所含有字母数存在是奇数或者偶数，所以需要从一个字符开始扩展，或者从两个字符之间开始扩展，所以总共有 2n-1 (n+n-1)个中心。

Kotlin代码实现：

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 leftIndex = left, rightIndex = right;
    while (leftIndex >= 0 && rightIndex < s.length() && s.charAt(leftIndex) == s.charAt(rightIndex)) {
        leftIndex --;
        rightIndex ++;
    }
    return rightIndex - leftIndex - 1;
}

参考：
https://leetcode.com/problems/longest-palindromic-substring