最长回文子串

题目描述

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”

代码如下

public class LongestPalindrome {

    private int lo, maxLen;

    public  String longestPalindrome(String s) {

        if (s.length() < 2)
            return s;

        for (int i = 0; i < s.length()-1; i++) {
            extendPalindrome(s, i, i);    //回文串是奇数，j,k都指向回文串中间
            extendPalindrome(s, i, i+1);  //回文串是偶数，j,k相邻指向
        }
        return s.substring(lo, lo + maxLen);
    }

    private  void extendPalindrome(String s, int j, int k) {
        while (j >= 0 && k < s.length() && s.charAt(j) == s.charAt(k)) {
            j--; //j,k这些都是局部变量，不要搞错了
            k++;
        }
        if (maxLen < k - j - 1) {//中间长度包含在(j,k),长度为 k+1-(j+1)+1，更正为：k-j+1-2=k-j-1;(先包含kj,再去掉边界)
            lo = j + 1;
            maxLen = k - j - 1;
        }
    }
}