马拉车算法-求解最长回文字符串

import java.util.*;

public class Main{
    public static void main(String args[]) {
        Scanner sc = new Scanner(System.in);
        String s = sc.nextLine();
        System.out.println(fun(s));
    }
    private static String fun(String s){
        int len = s.length();
        char[] c = new char[2*len+2];
        c[0]='$';
        c[1]='#';
        int index = 2;
        for(int i=0;i=0 && c[i+dp[i]]==c[i-dp[i]]){
                dp[i]++;
            }
            if(maxright

　　

转载于:https://www.cnblogs.com/xinyi-blog/p/9562835.html