#include<iostream>
#define maxsize 255
using namespace std;
typedef struct{
char ch[maxsize];
int length;
}sstring;
bool substring(sstring &sub, sstring s,int pos, int len)
{
if(pos+len-1>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;
}
int index(sstring s,sstring t)
{
int i=1;
sstring h;
while(i<=s.length-t.length+1)
{
substring(h,s,i,t.length);
if(strcompare(h,t)!=0)
++i;
else return i;
}
return 0;
}
int main()
{
sstring s={" wangdao",7};
sstring sub;
substring(sub,s,3,2);
cout<<sub.ch<<endl;
cout<<strcompare(s,sub)<<endl;
cout<<index(s,sub);
return 0;
}
串的cpp实现
最新推荐文章于 2024-07-17 17:53:42 发布