BF算法

#include <stdio.h>
#define MAXSIZE 255
typedef unsigned char SString[MAXSIZE + 1];
typedef int IneArr[10];//定义整形数组IntArr  IntArr a;

//求字符串的长度
int StrLength(SString S){
	int i = 1;
	while(S[i] != '\0'){
		i++;
	}
	return i - 1;
} 

int BF(SString S1,SString S2,int pos){
	int i = pos,j = 1;
	while(i <= S1[0] && j <= S2[0]){
		if(S1[i++] == S2[j++]);
		else{
			i = i + j -2;
			j = 1;
		}
	}
	if(j > S2[0])
    	return i - S2[0];
  	return 0;
	
}

int main(){
	SString S1,S2;//定义字符数组类型S
	printf("请输入字符串S1\t");
	scanf("%s",&S1[1]);//S+1 
	S1[0] = StrLength(S1);
	printf("S1的长度为%d\n",S1[0]);
	printf("请输入字符串S2\t");
	scanf("%s",&S2[1]);//S+1 
	S2[0] = StrLength(S2);
	printf("S2的长度为%d\n",S2[0]);
	printf("S2在S1的位置是\t%d\n",BF(S1,S2,1));
	return 0; 
}