KMP算法实现验证通过

#include <stdio.h>
#include <string.h>
#include <stdlib.h>

#define N 100

/*串结构体*/
typedef struct Stirngs
{
	char string[100];
	int length;
}sq;


/*next数组*/
//q为子串
void GetNext(sq q, int next[])
{
	int i = 0,j = -1;
	next[0] = -1;
	while (i < q.length)
	{
		if (j == -1 || q.string[i] == q.string[j])
		{
			i++;
			j++;
			next[i] = j;
		}
		else
			j = next[j];
	}

		for (i = 0; i < q.length; i++)
		{
            
			printf("%2d", next[i]);

		}
	
}
 /*Kmp算法*/
	int Kmp(sq s,sq p,int next[])
	{
		int c = 0;
		int d = 0;
		while (c < s.length && d < p.length)       //合法长度之内
		{
			if(d == -1||s.string[c]==p.string[d]) //d== -1代表是首字符；
				{
					c++;
					d++;
				}
			else
				d = next[d];                     //利用Next数组进行移动

		}

		if (d == p.length)
			return c - p.length;
		else
			return -1;
	}

	/*主函数*/
	int main(void)
	{
		int next[N];
		int a;
		sq s ;
		sq p ;
		printf("Please Input S string: \n");
		scanf("%s", s.string);
		printf("Please Input P string: \n");
		scanf("%s", p.string);
		s.length = strlen(s.string);
		p.length = strlen(p.string);
		GetNext(p,next);
		printf("\n");
		if (Kmp(s, p, next)!= -1)
		{
			printf("kmp匹配成功！");
			for (a = Kmp(s, p, next); a < Kmp(s, p, next) + p.length; a++)
			{
				printf("%c", s.string[a]);
			}
		}
		else
			printf("匹配失败！");

		printf("\n");
		return 0;
	}