HDU 5007 字符串匹配 BF KMP KMP改进*

#include <iostream>
#include<stdio.h>
#include<algorithm>
#include<string.h>
#include<math.h>
#define ENTER printf("\n");
#define ll long long
using namespace std;
char str[50];
const char s1[] = "Apple";
const char s2[] = "iPhone";
const char s3[] = "iPod";;
const char s4[] = "iPad";
const char s5[] = "Sony";
const char print_s1[] = "MAI MAI MAI!";
const char print_s2[] = "SONY DAFA IS GOOD!";
bool BF_match(char str1[], const char str2[])
{
	int len1 = strlen(str1);
	int len2 = strlen(str2);
	int j = 0;
	int i = 0;
	while(i<len1&&j<len2)
	{
		if (str1[i] == str2[j])
		{
			i++;
			j++;
			if (j >=len2)
				return true;
		}
		else
		{
			i = i - j + 1;
			j = 0;
		}
	}
	return false;
}
int main()
{
	while (scanf("%s", str) != EOF)
	{
		if (BF_match(str, s1) || BF_match(str, s2) || BF_match(str, s3) || BF_match(str, s4))
		{
			printf("%s\n", print_s1);
		}
		if (BF_match(str, s5))
		{
			printf("%s\n", print_s2);
		}
	}
}

KMP KMP改进