teststr.cpp

来自「这是本人精心搜集的关于常用图论算法的一套源码」· C++ 代码 · 共 39 行

#include "Str.h"
void main(void)
{int pos;
 String s1("123\"456\"7890"), s2("aba"), s3("abbaba"),s4("89"); 
 String s;
 
 cout<<"\ns1="<<s1<<"   s2="<<s2<<"    s3="<<s3<<endl;
 s = s2;  cout<< "\ns=" << s <<endl;
 
 int index = strstr(s1,s4);  cout<<"index="<<index;
 if(index == -1) cout<<" s4 not s1 substring\n";
 else { strncpy(s,s1,index); cout<< "\ns=" << s <<" Size="<<s.size()<<endl;}
 cout<< "\ns4=" << s4 <<endl;
 if(s4==s3)cout<<" s4 == s3\n ";
  else if(s4<s3)cout<<" s4 < s3\n";
       else  cout<<" s4 > s3\n";
 if(s3==s2)cout<<" s3 == s2\n ";
  else if(s3<s2)cout<<" s3 < s2\n";
       else  cout<<" s3 > s2\n";
       
 pos=s3.Find(s2);
 cout<<" Find s2 in s3 position="<<pos<<endl;
 
 pos=KMP_Find(s3,s2); // 用KMP算法实现Find
 cout<<" Find s2 in s3 position="<<pos<<endl;

 pos=KMP_Find(s1,s2); // 用KMP算法实现Find
 cout<<" Find s2 in s1 position="<<pos<<endl; 
 
 pos=strstr(s3,s2); // 用KMP算法实现Find
 cout<<"\n Find s2 in s3 position="<<pos<<endl; 
 
 pos=strstr(s1,s2); // 用KMP算法实现Find
 cout<<" Find s2 in s1 position="<<pos<<endl; 

}