字串匹配之樸素匹配

標籤：style   blog   http   color   io   os   ar   for   div   

 1 # include<iostream> 2 # include<cstdio> 3 # include<string> 4 using namespace std; 5 int index(char *a,char *b) 6 { 7     int n=0;//父串位移量，初始為0 8     while(a[n]!=‘\0‘) 9     {10         int m = n;11         int k; //子串位移量12         for(k = 0; b[k]!=‘\0‘; k++)13         {14             if(a[m++]!=b[k]) //不匹配，馬上停止15             {16                 break;17             }18         }19         if(b[k]==‘\0‘)//匹配成功20         {21             return n;22         }23         n++;//父串，開始移動24     }25     return -1;26 }27 int main()28 {29     char *a = "abcdef";30     char *b = "cdef";31     cout<<index(a,b)<<endl;32 }

View Code

 

字串匹配之樸素匹配