(5)求子串 int SubStr(STRING*sI, STRING S2,int start, int len) len2= ength(.2);/计算2的长度 if(start<1startlen2len2<=0len>len2-start+1)t )断 start和len的合理性 sl->str=(char*)malloc(sizoef(char)); sl->str[0=10;S1 >length=0; return ERROR sl->str=(char*)malloc((len+1)*sizeof(char)); if (slstr) return ERROR; sl->str[O.en-1=s2.strIstart-lstart+len-2 sl-> strlen]=”103; sI->length=len return OK; 请单鼠标左键换页!（5）求子串 int SubStr(STRING *s1,STRING s2,int start,int len) { len2=Length(s2); //计算s2的长度 if (start<1||start>len2||len2<=0||len>len2-start+1) { //判断start和len的合理性 s1->str=(char*)malloc(sizoef(char));s1->str[0]=’\0’;s1- >length=0;return ERROR;} s1->str=(char*)malloc((len+1)*sizeof(char)); if (!s1.str) return ERROR; s1->str[0..len-1]=s2.str[start-1..start+len -2]; s1->str[len]=’\0’; s1->length=len; return OK; }