阿里2015 研发笔试 求最长公共子串

给定一个query和一个text，均由小写字母组成。要求在text中找出以同样的顺序连续出现在query中的最长连续字母序列的长度。例如， query为“acbac”，text为“acaccbabb”，那么text中的“cba”为最长的连续出现在query中的字母序列，因此，返回结果应该为其长度3。请注意程序效率。

一、KMP实现：我是将每一个query的后缀都生成了一个后缀函数，不得不说这样太复杂了，我自己都不想再看到这种方法。如果text长度为m，query长度为n的话，预处理时间复杂度为O(m^2)，匹配时间复杂度为O(mn)。

#include <iostream>
#include <stdlib.h>
#include <string>
using namespace std;

int **PrefixFunc(char *query);

int KMP(char *test, char *query)
{
	if (test == NULL || query == NULL){
		return -1;
	}
	int tLen = strlen(test);
	int qLen = strlen(query);
	int **Prefix;
	Prefix = PrefixFunc(query);
	for (int i = 0; i < qLen; i++){
		for(int j = 0; j < qLen - i; j++){
			cout<<Prefix[i][j]<<" ";
		}
		cout<<endl;
	}
	cout<<endl;
	if (Prefix == NULL){
		return -1;
	}
	int *q = new int [qLen];
	int *MaxStringLen = new int [qLen];
	for (int i = 0; i < qLen; i++){
		q[i] = -1;
		MaxStringLen[i] = -1;
	}
	int i;
	int j;
	for ( i = 0; i < tLen; i++){
		for (j = 0; j < qLen; j++){
			
			while (q[j] > -1 && query[q[j] + j + 1] != test[i]){
				q[j] = Prefix[j][q[j]];
			}
			if (query[q[j] + j + 1] == test[i]){
				q[j] += 1;
			}
			if (q[j] == qLen - j - 1){
				MaxStringLen[j] = qLen - j - 1;
				q[j] = Prefix[j][q[j]];
			}
			
			if (q[j] > MaxStringLen[j]){
				MaxStringLen[j] = q[j];
			}
		}
	}
	int MaxLen = MaxStringLen[0];
	for (int i = 0; i < qLen; i++){
		MaxLen = (MaxLen > MaxStringLen[i] ? MaxLen:MaxStringLen[i]);
	}
	for (int i = 0; i < qLen; i++){
<span style="white-space:pre">		</span>delete[] Prefix[i];
<span style="white-space:pre">	</span>}
<span style="white-space:pre">	</span>delete[] Prefix;
	return MaxLen + 1;

}

int **PrefixFunc(char *query)
{
	if (query == NULL){
		return NULL;
	}
	int len = strlen(query);
	int **Pre = new int* [len];
	for (int i = 0; i < len; i++){
		Pre[i] = new int [len];
		
	}
	if (Pre == NULL){
		return NULL;
	}
	for (int i = 0; i < len; i++){
		Pre[i][0] = -1;
	}

	int q;
	int k;
	for (int i = 0; i < len; i++){
		k = -1;
		for (q = i + 1; q < len; q++){
			while (k > -1 && query[k + 1] != query[q]){
				k = Pre[i][k];
			}
			if (query[k + 1] == query[q]){
				k = k + 1;
			}
			Pre[i][q - i] = k;
		}
		
	}
	return Pre;
}

int main()
{
	char *test = "acaccbacbb";
	char *query = "acbac";
	cout<<"max len is"<<KMP(test, query)<<endl;
	system("pause");
}