数据结构（串的基本操作）

#include<iostream>
#include<stdlib.h>
using namespace std;
#define MAXLEN 255
typedef struct{
	char ch[MAXLEN];
	int length;
}SString;
typedef struct{
	char *ch;
	int length;
}HString;
typedef struct StringNode{
	char ch;
	struct StringNode *next;
}StringNode,*String;
// 查找Sub中S的位置并返回下标 
bool SubString(SString &Sub, SString S,int pos,int len){
	//The substring range is out of bounds
	Sub.ch = (char *)malloc(len*sizeof(char));
	if(pos+len-1>S.length)
		return false;
	if (pos<1 || pos>S.length)
	 	return false;
	for(int i=pos;i<pos+len;i++){
		Sub.ch[i-pos+1] = S.ch[i];
	}
	Sub.length=len;
	return true; 
}
int StrCompare(SString S,SString T){
	for(int i=1;i<=S.length&&i<=T.length;i++){
		if(S.ch[i]!=T.ch[i])
			return S.ch[i]-T.ch[i];
	}
	return (S.length-T.length);
}
Index(SString S,SString T){
	int n=S.length,m=T.length;
	SString sub;
	for(int i=1;i<=n-m+1;i++){
		SubString(sub,S,i,m);
		if(StrCompare(sub,T)==0){
			return i;
		}
	}
	return 0;
}
int main()
{
//	S.ch = (char *) malloc(MAXLEN *sizeof(char));
//	S.length=0;
}