KMP 串的模式匹配 (25分)

题目链接

代码写的一般，此处只做备忘，以后再看。

#define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<vector>
#include<string>
using namespace std;

void bulidmatch(string pattern, vector<int> &match, int m)
{
	match[0] = -1;
	int j = 1;
	while (j < m)
	{
		int i = match[j - 1];
		while (i >= 0)
		{
			if (pattern[i + 1] == pattern[j])
			{
				match[j] = i + 1;
				break;
			}
			else
				i = match[i];
		}
		if (i == -1)
			match[j] =( (pattern[j] == pattern[0]) ? 0 : -1 );
		j++;
	}
}

int kmp(string str, string pattern, int n, int m)
{
	if (n < m)
		return -1;
	vector<int> match(m);
	bulidmatch( pattern, match, m);
	int s=0, p=0;
	while (s < n && p < m)
	{
		if (str[s] == pattern[p])
		{
			s++;
			p++;
		}
		else
		{
			//s++;
			if (p > 0)
				p = match[p - 1] + 1;
			else
			{
				p = 0;
				s++;
			}
				
		}
	}
	if (p == m)
		return s - m;
	else
		return -1;
	
}

int main()
{	
	string str, pattern;
	int strlen, patternlen;
	cin >> str;
	strlen = str.size();
	
	int n;
	cin >> n;
	for (int i = 0; i < n; i++)
	{
		cin >> pattern;
		patternlen = pattern.size();
		int pos = kmp(str, pattern, strlen, patternlen);
		if (pos == -1)
			printf("Not Found\n");
		else
			cout << str.substr(pos) << endl;
	}

	return 0;
}