Kmp 与 BF算法

#include<bits/stdc++.h>
#include<conio.h>
using namespace std;
int next[200];

void GetNext(char *t,int lt)	//求next数组 
{
	int i=0,k=-1;
	next[0]=-1;
	while(i<lt-1)		// 根据已知的前j位推测第j+1位
	{
		if(k==-1||t[i]==t[k])
		{
			if(t[i+1]==t[k+1])
				next[++i]=next[++k];
			else
				next[++i]=++k;
		}
		else
			k=next[k];
	}
}
int Kmp(char *s,int ls,char *t,int lt)	//返回值为下标
{	
	int i=0,j=0;
	while(i<ls)
	{
		if(j==-1||s[i]==t[j])
		{
			++i,++j;
			if(j==lt)
				return i-j+1;
		}
		else
			j=next[j];
	}
	return -1;		//不存在
}

int BF(char *s,int len_s,char *t,int len_t)
{
	int i,pos;
	i=pos=0;
	int j=0;
	while(i<len_s && j<len_t)
	{
		if(s[i]==t[j])
			++i,++j;
		else
		{
			i=i-j+1;
			j=0;
		} 
	}
	if(j==len_t)
		return i-j+1;
	return -1; 
}
int main()
{
	char s[150],t[150];
	while(true)
	{
		system("CLS");
		cout << "输入模式串: " ;
		cin >> s;
		cout << "输入匹配串：" ;
		cin >> t;
		int len_s=strlen(s);
		int len_t=strlen(t);
		cout << "请选择算法：" << endl;
		cout << "1.KMP算法\n" << "2.BF算法" << endl;
		int choose,ans;
		cin >> choose;
		while(choose!=1 &&choose!=2)
		{
			cout << "选择有误，请重新选择！！！" << endl;
			cin >> choose;
		}
		switch(choose)
		{
			case 1:
				cout << "\n" << "您已选择KMP算法\n" << endl; 
				GetNext(t,len_t);
			    ans=Kmp(s,len_s,t,len_t);
			    if(ans!=-1) 
					cout << "开始的位置为：" << ans << "\n" << endl;
				else
					cout << "未找到！！！" << "\n" << endl;
				break;
			case 2:
				cout << "\n" << "您已选择BF算法\n" << endl;
				ans=BF(s,len_s,t,len_t);
				if(ans!=-1) 
					cout << "开始的位置为：" << ans << "\n" << endl;
				else
					cout << "未找到！！！" << "\n" << endl;
				break;
		}
		cout << "按任意键继续！！！" << endl;
		getch();
	}
	return 0;
}