leetcode-0005-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.

Example 1:

Input: "babad"
Output: "bab"
Note: "aba" is also a valid answer.

Example 2:

Input: "cbbd"
Output: "bb"

解题

解法1

循环找出 i 左右最长回文

class Solution {
    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 = calPalindrome(s, i, i);
            int len2 = calPalindrome(s, i, i+1);
            
            int len = len1 > len2 ? len1 : len2;
            if (end -start < len) {
                start = i - (len-1) / 2;
                end = i + len / 2;
            }
        }
        return s.substring(start, end+1);
    }
    
    public int calPalindrome(String s, int L, int R) {
        int l = L, r = R;
        while (l >= 0 && r < s.length() && s.charAt(l) == s.charAt(r)) {
            l--;
            r++;
        }
        return r-l-1;
    } 
}

解法2

Manacher’s Algorithm 马拉车算法
https://www.jianshu.com/p/7dacc9a3c9a0