重复词

class Periods {
public:
    long long getLongest(int n, string s) {
        long long r = 0;
        if(s.length() == 0)
            return r;
        const char *p = s.c_str();
        bool flag[100005];
        
        memset(flag, false, sizeof(flag));
        int lastIndex = n;
        int count = 1;
        for(int i=n-1;i>=1;i--)
        {
            count = 1;
            if(p[i] == p[0])
            {
                r += i;
                int tmp = 1;
                int k = i+1;
                while(k<n && tmp<i)
                {
                    if(p[tmp] == p[k])
                    {
                        if(p[k]!=p[0] && !flag[k])
                        {
                            flag[k] = true;
                            r += i;                         }                         tmp++;                         k++;                     }                     if(p[tmp] != p[k])                         break;                 }             }         }         return r;
    }
};

import java.util.*;

public class Periods {
    public long getLongest(int n, String s) {
        
        ArrayList<Integer> arr=new ArrayList<>();
        for(int i=n-1; i>0; i--){
            if(s.charAt(i)==s.charAt(0))
                arr.add(i);
        }
        int sum=0;
        int[] b=new int[n];
        for(int i=0; i<arr.size(); i++){
            for(int j=arr.get(i),k=0; j<n; j++,k++){
                if(s.charAt(j)==s.charAt(k))
                    b[j]=(b[j]>arr.get(i))? b[j]:arr.get(i);
                else
                    break;
            }
        }
        for(int ele: b)
            sum+=ele;
        return sum;
    }
}

Python通过
# -*- coding:utf-8 -*-
import collections
class Periods:
    def getLongest(self, n, s):
        ans = [0 for i in range(n)]
        start_c = s[0]
        start_index = []
        for i in range(1,n):
            if s[i]==start_c:
                start_index.append(i)
        for index in start_index[::-1]:
            ans[index] = index
            ans_temp = index
            temp = 1
            index+=1
            while index<n and (temp+1)*2<=(index+1) and s[index]==s[temp]:
                ans[index] = max(ans[index],ans_temp)
                index+=1
                temp+=1
        return sum(ans)

};

#include<string>
class Periods {
public:
	long long getLongest(int n, string s) {
		// write code here
		long long	res = 0;

		//1求所有前缀
		for (int i = 0; i <= n; i++)
		{
			
			string subS = s.substr(0, i);		//前缀

			bool get = false;	//是否获得最长重复词

			//判断是否是重复词。//要求之一是qq 有前缀A所以长度限制
			for (int k = i-1; k >= i / 2; k--)
			{
				//真前缀  i-1 保证
				string subsubS = subS.substr(0, k);
				
				//前缀
				string supS = subsubS + subsubS;
				string tmp = supS.substr(0, subS.length());
				if (subS == tmp)
				{
					get = true;
					cout << subS << ":::::" << "\t";        //输出测试
					cout << subsubS << endl;                //输出测试
					res += subsubS.length();
				}
				else if (get == true)break;
			}
		}
		return res;
	}
};

8,"babababa"

返回：24