求一个字符串中连续出现次数最多的子串

求一个字符串中连续出现次数最多的子串 

代码如下：以后用size_t

// LongestCommonString.cpp : 定义控制台应用程序的入口点。
//

#include "stdafx.h"
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>

using namespace std;

class LongestCommonString
{
	vector<string> suffixArray;
	size_t len;
public:

	//构造方法
	LongestCommonString(string s)
	{
		//构造后缀数组
		for(size_t i = 0; i < s.length(); ++i)
		{
			suffixArray.push_back(s.substr(i));
		}
		//排序
		sort(suffixArray.begin(), suffixArray.end());
		len = suffixArray.size();
	}

	//两两比较，返回最长长度的子串
	string lcpCompare()
	{
		size_t maxLength = 0;
		size_t index = 0;
		for(size_t i = 0; i < len - 1; ++i)
		{
			size_t temp = lcp(suffixArray.at(i), suffixArray.at(i+1));
			if(temp > maxLength)
			{
				maxLength = temp;
				index = i;
			}
		}
		return suffixArra