LeetCode 5 Longest Palindromic Substring

Given a string S, find the longest palindromic substring in S. You may assume that the maximum length of S is 1000, and there exists one unique longest palindromic substring.

找到一个字符串中最大的回文子字符串

程序来自：https://leetcode.com/discuss/56323/very-simple-clean-java-solution

public class Solution {private int lo, maxLen;public String longestPalindrome(String s) {    int len = s.length();    if (len < 2)        return s;    for (int i = 0; i < len-1; i++) {        extendPalindrome(s, i, i);  //assume odd length, try to extend Palindrome as possible        extendPalindrome(s, i, i+1); //assume even length.    }    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--;        k++;    }    if (maxLen < k - j - 1) {        lo = j + 1;        maxLen = k - j - 1;    }}}