数据结构与算法系列-串-串的基本操作

#include<malloc.h>#include<stdio.h>#define MAXLEN 25typedef struct string{char ch[MAXLEN];int len;}STRING;STRING connect(STRING s1,STRING s2)//串连接{STRING s;int i;if(s1.len + s2.len <=MAXLEN){for(i=0;i<s1.len;i++)//将s1存放在s中s.ch[i] = s1.ch[i];for(i=0;i<s2.len;i++)//将s2存放在s中s.ch[s1.len+i]=s2.ch[i];s.ch[s1.len+i] = '\0';s.len = s1.len + s2.len;}elses.len = 0;return (s);}int equal(STRING s1,STRING s2){int i;if(s1.len !=s2.len)return (0);else{for(i=0;i<s1.len;i++){if(s1.ch[i]!=s2.ch[i])return (0);}}return (1);}/*STRING substring(STRING s,int n1,int n2){//取子串运算STRING sub;int i;if((n1>=1)&&(n1<=s.len)&&(n2>=1)&&(n2<=s.len-n1+1)){//如果长度和起始位置合理for(int i=0;i<n2;i++)sub.ch[i] = s.ch[n1+i-1];sub.ch[i]='\0';sub.len = n2;}else{sub.ch[0]='\0';sub.len = 0;}return(sub);}*//*STRING insert(STRING s,STRING s1,int i){int j;STRING s2 ={"",0};if((s.len+s1.len>=MAXLEN) || (i>s.len+1) ||(i<1)){printf("overflow\n");return(s2);}else{for(j=s.len;j>=i;j--)s.ch[j+s1.len-1] = s.ch[j-1];//s串最后一个到第i个位置的元素后移for(j=0;j<s1.len;j++)s.ch[j+i-1] = s1.ch[j];//插入s1到指定的位置s.len = s.len + s1.len;return s;}}*/STRING deleteString(STRING s,int i,int j){int k;STRING s1 = {"",0};if((i<1)||(i>s.len)){printf("error\n");return (s1);}else{if(s.len-i+1){//第i个位置开始到最后的字符数不足j个时s.ch[i-1] = '\0';s.len = i-1;return s;}else{for(k=i+j-1;k<s.len;k++)//元素向前移动j位s.ch[k-j]=s.ch[k];s.len = s.len - j;//s串长度减jreturn s;}}}int match(STRING s,STRING s1){int i,j,k;i=0;while(i<s.len-s1.len){//i为s串中字符的位置,每次前进一个位置 该循环执行到s串中剩余长度不够比较为止j = i;//j用作临时计数变量k =0 ;while((k<s1.len)&&(s.ch[j]==s1.ch[k])){j = j+1;k= k+1;}if(k==s1.len)return (i);elsei = i+1;}return (-1);}main(){STRING a1 ={"Beijin china",13},a2={"china",5},s;//s = connect(a1,a2);//printf("\n%s\n%d",s.ch,s.len);//int r;//r = equal(a1,a2);//printf("\n%d",r);//s= substring(a1,1,4);//printf("\n%s\n",s.ch);//int i = 8;/*s = insert(a1,a2,i);if(s.len!=0){for(i=0;i<s.len;i++)printf("%c",s.ch[i]);printf("\n%d\n",s.len);}*///int i=10,j=4;//s = deleteString(a1,i,j);//printf("\n%s\n%d",s.ch,s.len);int r;r=match(a1,a2);printf("\n%d",r);}